Enumeration of Labelled Graphs II: Cubic Graphs with a given Connectivity

DOI10.1112/JLMS/S2-20.1.1MaRDI QIDQ4192092zbMATHOpenAlexFDO

Authors Nicholas Wormald

Publication date 1979

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/s2-20.1.1

Mathematics Subject Classification ID

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

Cited in

(9)

• Counting labeled claw-free cubic graphs by connectivity
• Ménage numbers, bijections and P-recursiveness
• ${\cal N}=2$ N = 2 gauge theories: Congruence subgroups, coset graphs, and modular surfaces
• The asymptotic connectivity of labelled regular graphs
• Counting labeled general cubic graphs
• Invertibility of adjacency matrices for random \(d\)-regular graphs
• The asymptotic number of claw-free cubic graphs.
• On the Number of Automorphisms of a Regular Graph
• Enumeration of cubic graphs by inclusion-exclusion

This page was built for publication: Enumeration of Labelled Graphs II: Cubic Graphs with a given Connectivity

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