|
|
A338593
|
|
Number of unlabeled connected nonplanar graphs with n edges with degree >= 3 at each node.
|
|
7
|
|
|
1, 2, 3, 10, 30, 100, 371, 1419, 5764, 24482, 107583, 487647, 2271488, 10847623
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
9,2
|
|
COMMENTS
|
First differs from A338583 for n = 13. All unlabeled nonplanar graphs with n <= 12 edges and degree >= 3 at each node are 3-connected. For this reason the illustrations of the graphs are identical up to n = 12. The first differences for n = 13 and n = 14 are shown in the illustrations of A338584.
|
|
LINKS
|
|
|
FORMULA
|
|
|
PROG
|
(PARI) \\ It is assumed that the a338593.gp file (from the linked zip archive) has been read before, i.e., \r [path]a338593.gp
for(k=9, #EdgeDataNonplanarDegge3, print1(#EdgeDataNonplanarDegge3[k], ", "));
\\ printing of the edge lists of the graphs for n <= 11
print(EdgeDataNonplanarDegge3[9..11])
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|