A366225 Number of 3-connected unlabeled graphs on n nodes with girth at least 6.

1, 0, 1, 0, 7, 6, 87, 305, 3730, 39140

Offset: 14

Author

Brendan McKay, Oct 05 2023

Keywords

• nonn
• hard

Examples

			The smallest graph in the class is the Heawood graph with 14 vertices.
		

Crossrefs

Cf. A366224 (3-connected graphs of girth at least 5).