The asymptotic number of claw-free cubic graphs.

DOI10.1016/S0012-365X(03)00188-2zbMath1035.05053OpenAlexW2091140517MaRDI QIDQ1415549

Brendan D. McKay, Robert W. Robinson, Edgar M. Palmer, Ronald C. Read

Publication date: 4 December 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00188-2

zbMATH Keywords

asymptotic enumerationcubic graphsclaw-free

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Asymptotic enumeration (05A16)

Related Items

Counting labeled claw-free cubic graphs by connectivity, Enumeration of cubic graphs by inclusion-exclusion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automorphisms of random graphs with specified vertices
• The asymptotic distribution of short cycles in random regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• Counting labeled general cubic graphs
• Hamilton cycles containing randomly selected edges in random regular graphs
• Enumeration of Labelled Graphs I: 3-Connected Graphs
• Enumeration of Labelled Graphs II: Cubic Graphs with a given Connectivity
• Counting Claw-Free Cubic Graphs
• The Enumeration of Locally Restricted Graphs (II)