Construction of planar triangulations with minimum degree 5

Discrete Mathematics

Volumn 301, Issue 2-3, 2005, Pages 147-163

  Brinkmann, G ^a,c   McKay, Brendan D ^b  

^a BIELEFELD UNIVERSITY   (Germany)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^c GHENT UNIVERSITY   (Belgium)

Author keywords

Cubic graph; Fullerene; Generation; Planar triangulation

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; FULLERENES;

CONVEX POLYTOPES; CUBIC GRAPHS; PLANAR TRIANGULATION;

GRAPH THEORY;

EID: 26444591523     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.06.019     Document Type: Article

References (14)

1. R.E.L. Aldred, S. Bau, D.A. Holton, and B.D. McKay Nonhamiltonian 3-connected cubic planar graphs SIAM J. Discrete Math. 13 2000 25 32
2. D. Barnette On generating planar graphs Discrete Math. 7 1974 199 208
3. V. Batagelj, An inductive definition of the class of all triangulations with no vertex of degree smaller than 5, in: Proceedings of the Fourth Yugoslav Seminar on Graph Theory, Novi Sad, 1983.
4. G. Brinkmann, and A.W.M. Dress A constructive enumeration of fullerenes J. Algorithms 23 1997 345 358
5. G. Brinkmann, B.D. McKay, Programs plantri and fullgen, available at 〈http://cs.anu.edu.au/~bdm/plantri〉.
6. J.W. Butler A generation procedure for the simple 3-polytopes with cyclically 5-connected graphs Canad. J. Math. XXVI 3 1974 686 708
7. M.B. Dillencourt Polyhedra of small order and their hamiltonian properties J. Combin. Theory Ser. B 66 1 1996 87 122
8. V. Eberhard, Zur Morphologie der Polyeder, Teubner, 1891.
9. P.W. Fowler, and D.E. Manolopoulos An Atlas of Fullerenes 1995 Oxford University Press Oxford
10. J. Gao, I. Wanless, and N.C. Wormald Counting 5-connected planar triangulations J. Graph Theory 38 2001 18 35
11. D.W. Grace, Computer search for non-isomorphic convex polyhedra, Technical Report, Stanford University, Computer Science Department, 1965, Technical report C515.
12. B. Grünbaum Convex Polytopes second ed. 2003 Springer New York
13. B.D. McKay Isomorph-free exhaustive generation J. Algorithms 26 1998 306 324
14. E. Steinitz, and H. Rademacher Vorlesungen über die Theorie der Polyeder 1934 Springer Berlin