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,5

Links

Table of n, a(n) for n=14..23.

Example

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

Crossrefs

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

Sequence in context: A288245 A038272 A249992 * A223531 A130553 A284210

Adjacent sequences: A366222 A366223 A366224 * A366226 A366227 A366228

Keyword

nonn,hard

Author

Brendan McKay, Oct 05 2023

Status

approved