Enumeration of non-separable graphs
- 1 December 1970
- journal article
- Published by Elsevier in Journal of Combinatorial Theory
- Vol. 9 (4), 327-356
- https://doi.org/10.1016/s0021-9800(70)80089-8
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Enumeration of colored graphsJournal of Combinatorial Theory, 1968
- COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. IIProceedings of the National Academy of Sciences, 1956
- The number of linear, directed, rooted, and connected graphsTransactions of the American Mathematical Society, 1955
- On the Number of Husimi TreesProceedings of the National Academy of Sciences, 1953
- The Number of TreesAnnals of Mathematics, 1948
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische VerbindungenActa Mathematica, 1937
- The Theory of Group-Reduced DistributionsAmerican Journal of Mathematics, 1927