|
Search: id:A111357
|
|
|
| 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
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
12,5
|
|
|
REFERENCES
|
G. Brinkmann and B. D. McKay, Construction of planar triangulations with minimum degree 5, Discr. Math. 301 (2005), 147-163.
|
|
LINKS
|
G. Brinkmann and B. D. McKay plantri.
G. Brinkmann, CaGe.
|
|
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
|
Cf. A081621, A007894.
Sequence in context: A071332 A006791 A111358 this_sequence A081621 A073713 A084921
Adjacent sequences: A111354 A111355 A111356 this_sequence A111358 A111359 A111360
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Gunnar Brinkmann (Gunnar.Brinkmann(AT)UGent.be), Nov 07 2005
|
|
|
Search completed in 0.002 seconds
|
