|
| |
|
|
A255600
|
|
Number of connected planar regular graphs on 2n vertices with girth at least 4.
|
|
0
|
|
|
|
1, 1, 2, 5, 13, 39, 154, 638, 3047, 15415, 82252, 451900
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
4,3
|
|
|
COMMENTS
|
By Euler's formula, all such graphs must be 3-regular.
|
|
|
REFERENCES
|
M. Kirchweger, M. Scheucher, and S. Szeider, SAT-Based Generation of Planar Graphs, in preparation.
|
|
|
LINKS
|
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,more,hard
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
