Enumeration of cyclically 4-connected cubic graphs

DOI10.1002/JGT.3190090418MaRDI QIDQ3815321zbMATH OpenOpenAlexWikidataFDO

Authors Nicholas Wormald

Publication date 1985

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190090418

zbMATH Keywords

labeled cyclically 4-connected cubic graphsrecurrence relation

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Connectivity (05C40)

Recommendations

• Counting labeled general cubic graphs
• Counting labeled claw-free cubic graphs by connectivity
• Counting Claw-Free Cubic Graphs
• scientific article; zbMATH DE number 3952807
• Enumeration of labeled connected graphs with given order and size

Cites work

• A Census of Hamiltonian Polygons
• A Census of Planar Maps
• Graph theory with applications
• Some Unusual Enumeration Problems

Cited in

(11)

• Random triangulations of the plane
• Enumeration of cubic graphs by inclusion-exclusion
• The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
• The number of 4-cycles in triangle-free oriented graphs
• Renormalized asymptotic enumeration of Feynman diagrams
• Counting labeled general cubic graphs
• Enumeration of rooted nearly cubic c-nets
• Numbers of cubic graphs
• Counting Claw-Free Cubic Graphs
• The number of 4-cycles and the cyclomatic number of a finite simple graph
• Feynman symmetries of the Martin and c₂ invariants of regular graphs

This page was built for publication: Enumeration of cyclically 4-connected cubic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3815321)