|
|
A262322
|
|
The number of 4-connected triangulations of the triangle with n inner vertices.
|
|
0
|
|
|
1, 0, 0, 1, 1, 3, 13, 47, 217, 1041, 5288, 27844, 150608, 831229
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,6
|
|
COMMENTS
|
Also the number of 4-connected simplicial polyhedra with n nodes with one marked face.
Values obtained by generating 4-connected simplicial polyhedra with plantri, marking each face in the polyhedron, and then sorting out isomorphic ones.
|
|
LINKS
|
Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph.
Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph [Cached copy, pdf file only, no active links, with permission]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|