|
|
A366225
|
|
Number of 3-connected unlabeled graphs on n nodes with girth at least 6.
|
|
1
|
|
|
|
OFFSET
|
14,5
|
|
LINKS
|
|
|
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).
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|