Polyhedra of small order and their Hamiltonian properties

Journal of Combinatorial Theory. Series B

Volumn 66, Issue 1, 1996, Pages 87-122

  Dillencourt, Michael B ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0029718544     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1996.0008     Document Type: Article

References (49)

1. 1. F. AURENHAMMER, Voronoi diagrams - A survey of a fundamental geometric data structure, ACM Comput. Surveys 23, No. 3 (1991), 345-405.
2. 2. D. BARNETTE AND E. JUCOVIČ, Hamiltonian circuits on 3-polytopes, J. Combin. Theory 9, No. 1 (1970), 54-59.
3. 3. V. BATAGELJ, Inductive definition of two restricted classes of triangulations, Discrete Math. 52, No. 2-3 (1984), 113-121.
4. 4. V. BATAGELJ, An inductive definition of the class of 3-connected quadrangulations of the plane, Discrete Math. 78, No. 1-2 (1989), 45-53.
5. 5. J. A. BONDY AND U. S. R. MURTY, "Graph Theory with Applications," North-Holland, New York, 1976.
6. 6. R. BOWEN AND S. FISK, Generation of triangulations of the sphere, Math. Comp. 21, No. 98 (1967), 250-252.
7. 7. V. CHVÁTAL, Planarity of graphs with given degrees of vertices, Nieuw Arch. Wisk. 17, (1969), 47-60.
8. 8. V. CHVÁTAL, Tough graphs and Hamiltonian circuits, Discrete Math. 5 (1973), 215-228.
9. 9. M. B. DILLENCOURT, A non-Hamiltonian, nondegenerate Delaunay triangulation, Inform. Process. Lett. 25, No. 3 (1987), 149-151.
10. 10. M. B. DILLENCOURT, An upper bound on the shortness exponent of inscribable graphs, J. Combin. Theory Ser. B 46, No. 1 (1989), 66-83.
11. 11. M. B. DILLENCOURT, Toughness and Delaunay triangulations, Discrete Comput. Geom. 5, No. 6 (1990), 575-601.
12. 12. M. B. DILLENCOURT, An upper bound on the shortness exponent of 1-tough, maximal planar graphs, Discrete Math. 90, No. 1 (1991), 93-97.
13. 13. M. B. DILLENCOURT, On the toughness index of planar graphs, J. Graph Theory 18, No. 1 (1994), 103-107.
14. 14. M. B. DILLENCOURT AND W. D. SMITH, A linear-time algorithm for testing the inscribability of trivalent polyhedra, in "Proceedings Eighth Annual ACM Symposium on Computational Geometry, Berlin, Germany, June 1992," pp. 177-185; Internat. J. Comput. Geom. Appl., to appear.
15. 15. M. B. DILLENCOURT AND W. D. SMITH, A simple method for resolving degeneracies in Delaunay triangulations, in "Automata, Languages, and Programming: Proceedings, 20th International Colloquium, Lund, Sweden, July 1993," pp. 177-188; Lecture Notes in Computer Science, Vol. 700, Springer-Verlag, New York/Berlin.
16. 16. M. B. DILLENCOURT AND W. D. SMITH, Graph-theoretical conditions for inscribability and Delaunay realizability, in "Proceedings, Sixth Canadian Conference on Computational Geometry, Saskatoon, Saskatchewan, August 1994," pp. 287-292; Discrete math., to appear.
17. 17. A. J. W. DUIJVESTIJN, private communication.
18. 18. A. J. W. DUIJVESTIJN AND P. J. FEDERICO, The number of polyhedral (3-connected planar) graphs, Math. Comp. 37, No. 156 (1981), 523-532.
19. 19. H. EDELSBRUNNER, "Algorithms in Combinatorial geometry," EATCS Monographs on Theoretical Computer Science, Vol. 10, Springer-Verlag, Berlin, 1987.
20. 20. P. ENGEL, On the enumeration of polyhedra, Discrete Math. 41, No. 2 (1982), 215-218.
21. 21. P. J. FEDERICO, Enumeration of polyhedra: The number of 9-hedra, J. Combin. Theory 7, No. 2 (1969), 155-161.
22. 22. B. GRÜNBAUM, "Convex Polytopes," Wiley Interscience, New York, 1967.
23. 23. B. GRÜNBAUM AND H. WALTHER, Shortness exponents of families of graphs, J. Combin. Theory 14, No. 3 (1973), 364-385.
24. 24. C. D. HODGSON, I. RIVIN, AND W. D. SMITH, A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere, Bull. Amer. Math. Soc. 27, No. 2 (1992), 246-251; Erratum, Bull. Amer. Math. Soc. 28, No. 1 (1993), 213.
25. 25. D. A. HOLTON, B. MANVEL, AND B. D. MCKAY, Hamiltonian cycles in cubic 3-connected bipartite planar graphs, J. Combin. Theory Ser. B 38, No. 3 (1985), 279-297.
26. 26. D. A. HOLTON AND B. D. MACKAY, The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices, J. Combin. Theory Ser. B 45, No. 3 (1988), 305-319.
27. 27. J. E. HOPCROFT AND R. E. TARJAN, A V log V algorithm for isomorphism of triconnected planar graphs, J. Comput. System Sci. 7, No. 3 (1973), 323-331.
28. 28. M. HUCHER, G. SAVATIER, AND J. GROLIER, Effectifs des diverses séquences de polyèdres 3-valents convexes ayant moins de 11 faces et de polyèdres sans face triangulaire ayant de 11 à 14 faces, Discrete Appl. Math. 2, No. 3 (1980), 255-257.
29. 29. V. KANTABUTRA, Traveling salesman cycles are not always subgraphs of Voronoi duals, Inform. Process. Lett. 16, No. 1 (1983), 11-12.
30. 30. D. E. KNUTH, "The Art of Computer Programming, Vol. 3, Sorting and Searching," Addison-Wesley, Reading, MA, 1973.
31. 31. C. MATHIEU, Some problems in computational geometry, Algorithmica 2, No. 1 (1987), 131-133.
32. 32. T. NISHIZEKI, A 1-tough Nonhamiltonian maximal planar graph, Discrete Math. 30, No. 3 (1980), 305-307.
33. 33. J. O'ROURKE, The computational geometry column No. 2, Comput. Graphics 21, No. 2 (1987), 155-157.
34. 34. M. D. PLUMMER, Problems, in "Infinite and Finite Sets, Vol. III" (A. Hajnal, R. Rado, and V. T. Sós, Eds.), pp. 1549-1550, North-Holland, Amsterdam, 1973.
35. 35. F. P. PREPARATA AND M. I. SHAMOS, "Computational geometry: An Introduction," Springer-Verlag, New York, 1985.
36. 36. I. RIVIN, A characterization of ideal polyhedra in hyperbolic 3-space, preprint, 1992.
37. 37. I. RIVIN, Some applications of the hyperbolic volume formula of Lobachevskii and Milnor, preprint, 1992.
38. 38. I. RIVIN, On geometry of convex ideal polyhedra in hyperbolic 3-space, Topology 32, No. 1 (1993), 87-92.
39. 39. I. RIVIN AND W. D. SMITH, Inscribable graphs, manuscript, NEC Research Institute, Princeton, NJ, 1991.
40. 40. E. F. SCHMEIDEL AND G. S. BLOOM, Connectivity, genus, and the number of components in vertex-deleted subgraphs, J. Combin. Theory Ser. B 27, (1979), 198-201.
41. 41. M. I. SHAMOS, "Computational geometry," Ph.D. thesis, Yale University, New Haven, CT, 1978.
42. 42. W. D. SMITH, On the enumeration of inscribable graphs, manuscript, NEC Research Institute, Princeton, NJ, 1991.
43. 43. R. THOMAS AND X. YU, 4-connected projective-planar graphs are Hamiltonian, J. Combin. Theory Ser. B 62, No. 1 (1994), 114-132.
44. 44. C. THOMASSEN, Planar and infinite hypohamiltonian and hypotraceable graphs, Discrete Math. 14, No. 4 (1976), 377-389.
45. 45. C. THOMASSEN, A theorem on paths in planar graphs, J. Graph Theory 7, No. 2 (1983), 169-176.
46. 46. M. TKÁČ, On the shortness exponent of 1-tough, maximal planar graphs, manuscript, 1993.
47. 47. W. T. TUTTE, A theorem on planar graphs, Trans. Amer. Math. Soc. 82 (1956), 99-116.
48. 48. W. T. TUTTE, A theory of 3-connected graphs, Proc. Kon. Nederl. Akad. Wetensch. Ser. A 64 (1961), 441-455.
49. 49. W. T. TUTTE, Bridges and Hamiltonian circuits in planar graphs, Aequationes Math. 15 (1977), 1-33.