| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650455 | Discrete Mathematics | 2008 | 8 Pages |
Abstract
Claw-free cubic graphs are counted with given connectedness and order. Tables are provided for claw-free cubic graphs with given connectedness. This builds on methods for counting general cubic graphs by connectivity previously developed by Chae, Palmer, and Robinson, and on the earlier enumeration of all claw-free cubic graphs by McKay, Palmer, Read, and Robinson.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gab-Byung Chae,