Counting labeled claw-free cubic graphs by connectivity

DOI10.1016/j.disc.2007.09.034zbMath1157.05030OpenAlexW2051034948MaRDI QIDQ2519828

Gab-Byung Chae

Publication date: 27 January 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.09.034

zbMATH Keywords

recurrence relationsexponential generating functionsclaw-free graphsgeneral cubic graphslabeled enumeration

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Enumeration of regular graphs 100 years ago
• The asymptotic number of claw-free cubic graphs.
• Counting labeled general cubic graphs
• Enumeration of Labelled Graphs II: Cubic Graphs with a given Connectivity
• Counting Claw-Free Cubic Graphs

This page was built for publication: Counting labeled claw-free cubic graphs by connectivity