|
|
A078672
|
|
Number of simple 4-regular 4-edge-connected but not 3-connected plane graphs on n nodes.
|
|
2
|
|
|
0, 0, 0, 0, 0, 0, 1, 1, 6, 16, 59, 188, 685, 2412, 8825, 32110, 118505
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
6,9
|
|
LINKS
|
|
|
EXAMPLE
|
The first such graph has 12 nodes. It is called 12E [Jablan, Radović & Sazdanović, Fig. 2; or Caudron, p. 308c] and looks like that:
___________
/ \
/ O---O O---O
|/|\ /|\ /|\ /|
O | O | O | O |
|\|/ \|/ \|/ \|
\ O---O O---O
\___________/
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|