Counting labeled claw-free cubic graphs by connectivity Original Research Article

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.