COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I
From MaRDI portal
Publication:3236811
DOI10.1073/pnas.42.3.122zbMath0071.39101OpenAlexW4213353021WikidataQ37614935 ScholiaQ37614935MaRDI QIDQ3236811
Publication date: 1956
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC528231
Related Items (21)
The number of \(m\)-Husimi trees fixed by a permutation of the vertices ⋮ On topological properties of some molecular cactus chain networks and their subdivisions by using line operator ⋮ On enumeration of labelled connected graphs by the number of cutpoints ⋮ Enumeration of labeled connected graphs with given order and size ⋮ Enumeration of bipartite graphs and bipartite blocks ⋮ A generalization of a result of A. Rényi ⋮ Topological Derivation of the Mayer Density Series for the Pressure of an Imperfect Gas ⋮ Counting complements in the partition lattice, and hypertrees ⋮ Enumeration of connected graphs with cut vertices ⋮ On the classification and enumeration of self-dual codes ⋮ Random hypertrees and hyperforests ⋮ Cayley's formula for multidimensional trees ⋮ Kombinatorische Anzahlbestimmungen in Relationen ⋮ The Second Riddell Relation and Its Consequences ⋮ The numbers of labeled colored and chromatic trees ⋮ The number of homeomorphically irreducible trees, and other species ⋮ The number of connected graphs with \(k\) cycles on labeled nodes ⋮ The enumeration of labeled graphs by number of cutpoints ⋮ Enumeration of smooth labelled graphs ⋮ On Ordering and Identifying Undirected Linear Graphs ⋮ Patchworks and metablocks enumeration
This page was built for publication: COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I
