论文信息 - Construction of planar triangulations with minimum degree 5

Construction of planar triangulations with minimum degree 5

In this article, we describe a method of constructing all simple triangulations of the sphere with minimum degree 5; equivalently, 3-connected planar cubic graphs with girth 5. We also present the results of a computer program based on this algorithm, including counts of convex polytopes of minimum degree 5.

Brendan D. McKay | Gunnar Brinkmann

[1] V. Eberhard. Zur Morphologie der Polyeder , 1891 .

[2] D. Manolopoulos,et al. An Atlas of Fullerenes , 1995 .

[3] J. W. Butler. A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs , 1974, Canadian Journal of Mathematics.

[4] E. Steinitz,et al. Vorlesungen über die Theorie der Polyeder unter Einfluss der Elemente der Topologie , 1934 .

[5] Brendan D. McKay,et al. Isomorph-Free Exhaustive Generation , 1998, J. Algorithms.

[6] Brendan D. McKay,et al. Nonhamiltonian 3-Connected Cubic Planar Graphs , 2000, SIAM J. Discret. Math..

[7] G. C. Shephard,et al. Convex Polytopes , 1969, The Mathematical Gazette.

[8] Michael B. Dillencourt,et al. Polyhedra of Small Order and Their Hamiltonian Properties , 1996, J. Comb. Theory, Ser. B.

[9] David W. Barnette. On generating planar graphs , 1974, Discret. Math..

[10] H. S. M. Coxeter,et al. Vorlesungen über die Theorie der Polyeder , 1935 .

[11] Nicholas C. Wormald,et al. Counting 5‐connected planar triangulations , 2001, J. Graph Theory.

[12] Andreas W. M. Dress,et al. A Constructive Enumeration of Fullerenes , 1997, J. Algorithms.

[13] D. Grace. Computer search for non-isomorphic convex polyhedra. , 1965 .