login
A111357
Numbers of planar triangulations with minimum degree 5 and without separating 3-cycles - that is 3-cycles where the interior and exterior contain at least one vertex.
0
1, 0, 1, 1, 3, 4, 12, 23, 73, 191, 649, 2054, 7209, 24963, 89376, 320133, 1160752, 4218225, 15414908, 56474453, 207586410, 764855802, 2825168619, 10458049611, 38795658003, 144203518881, 537031911877, 2003618333624, 7488436558647
OFFSET
12,5
LINKS
G. Brinkmann, CaGe.
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]
G. Brinkmann and Brendan D. McKay, Construction of planar triangulations with minimum degree 5 , Disc. Math. vol 301, iss. 2-3 (2005) 147-163.
EXAMPLE
The icosahedron is the smallest triangulation with minimum degree 5 and it doesn't contain any separating triangles. Examples can easily be seen as 2D and 3D pictures using the program CaGe cited above.
CROSSREFS
Sequence in context: A071332 A006791 A111358 * A081621 A073713 A291023
KEYWORD
nonn
AUTHOR
Gunnar Brinkmann, Nov 07 2005
STATUS
approved