Enumeration Of Labelled Graphs

DOI10.4153/CJM-1956-046-2zbMath0071.39102OpenAlexW2330810111MaRDI QIDQ3236812

E. N. Gilbert

Publication date: 1956

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1956-046-2

zbMATH Keywords

topology

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (19)

Signatures of extremal 2-unifrom hypergraphs ⋮ A logical approach to asymptotic combinatorics I. First order properties ⋮ Counting labelled three-connected and homeomorphically irreducible two- connected graphs ⋮ The number of unlabelled graphs with many nodes and edges ⋮ The probability of connectedness of a large unlabelled graph ⋮ Enumerating alternating matrix spaces over finite fields with explicit coordinates ⋮ Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs ⋮ A Logarithmic Connection for Circular Permutation Enumeration ⋮ On the classification and enumeration of self-dual codes ⋮ The enumeration of homeomorphically irreducible labelled graphs ⋮ Categorical aspects of generating functions. I: Exponential formulas and Krull-Schmidt categories ⋮ An exact probability distribution on the connectivity of random graphs ⋮ Transformation and topological reduction of cluster expansions using \(m\)-bonds ⋮ The Möbius function and connected graphs ⋮ Depth-first search as a combinatorial correspondence ⋮ The number of strongly connected directed graphs ⋮ The maximum number of colorings of graphs of given order and size: a survey ⋮ The number of homeomorphically irreducible trees, and other species ⋮ Enumeration of smooth labelled graphs

This page was built for publication: Enumeration Of Labelled Graphs