|
Search: id:A111358
|
|
|
| A111358 |
|
Numbers of planar triangulations with minimum degree 5 and without separating 3- or 4-cycles - that is 3- or 4-cycles where the interior and exterior contain at least one vertex. |
|
+0
1
|
|
| 1, 0, 1, 1, 3, 4, 12, 23, 71, 187, 627, 1970, 6833, 23384, 82625, 292164, 1045329, 3750277, 13532724, 48977625, 177919099, 648145255, 2368046117, 8674199554, 31854078139, 117252592450, 432576302286, 1599320144703, 5925181102878
(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.
G. Brinkmann and Brendan D. McKay, Construction of planar triangulations with minimum degree 5 , Disc. Math. vol 301, iss. 2-3 (2005) 147-163. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 17 2008]
D. A. Holton and B. D. McKay, The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices, J. Combinat. Theory B vol 45, iss. 3 (1988) 305-319. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 17 2008]
D. A. Holton and B. D. McKay, Erratum, J. Combinat. Theory B vol 47, iss. 2 (1989) 248. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 17 2008]
|
|
EXAMPLE
|
The icosahedron is the smallest triangulation with minimum degree 5 and it doesn't contain any separating 3- or 4-cycles. Examples can easily be seen as 2D and 3D pictures using the program CaGe cited above.
|
|
CROSSREFS
|
Cf. A081621, A007894.
Cf. A006791. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 17 2008]
Sequence in context: A075223 A071332 A006791 this_sequence A111357 A081621 A073713
Adjacent sequences: A111355 A111356 A111357 this_sequence A111359 A111360 A111361
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Gunnar Brinkmann (Gunnar.Brinkmann(AT)UGent.be), Nov 07 2005
|
|
|
Search completed in 0.002 seconds
|
