|
|
A338594
|
|
Number of unlabeled connected planar graphs with n edges with degree >= 3 at each node.
|
|
6
|
|
|
1, 0, 1, 2, 3, 6, 17, 37, 98, 275, 797, 2414, 7613, 24510, 80721, 270018, 915034
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
6,4
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(6) = 1: the 3-connected edge graph of the tetrahedron;
a(7) = 0: no connected planar graph with degree >=3 at each node exists;
a(8) = 1: the 3-connected 5-wheel graph, edge graph of 4-sided pyramid;
a(9)-a(11): see linked illustrations.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|