Counting labeled general cubic graphs

Recurrence relations are derived for the numbers of labeled 3-regular graphs with given connectivity, order, number of double edges, and number of loops. This work builds on methods previously developed by Read, Wormald, Palmer, and Robinson. © 2007 Elsevier B.V. All rights reserved. MSC: 05A15

• Type: Journal
• Year: 2007
• Where: DM
• Authors: Gab-Byung Chae, Edgar M. Palmer, Robert W. Robinson
• Keywords: 3-regular Graphs, DM 2007, Double Edges, Recurrence Relations