Counting labeled general cubic graphs
From MaRDI portal
Publication:2462366
DOI10.1016/j.disc.2007.03.011zbMath1126.05011OpenAlexW1992152272MaRDI QIDQ2462366
Gab-Byung Chae, Robert W. Robinson, Edgar M. Palmer
Publication date: 30 November 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.011
connectivityrecurrence relationsexponential generating functionsgeneral cubic graphslabeled enumeration
Related Items
The asymptotic number of claw-free cubic graphs. ⋮ ${\cal N}=2$ N = 2 gauge theories: Congruence subgroups, coset graphs, and modular surfaces ⋮ Counting labeled claw-free cubic graphs by connectivity ⋮ Expected Maximum Block Size in Critical Random Graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Enumeration of regular graphs 100 years ago
- The exponential generating function of labelled blocks
- The asymptotic number of labeled graphs with given degree sequences
- Enumeration of Labelled Graphs II: Cubic Graphs with a given Connectivity
- Number of labeled 4-regular graphs
- Counting Claw-Free Cubic Graphs
- Some Unusual Enumeration Problems