Nonhamiltonian 3-connected cubic planar graphs

SIAM Journal on Discrete Mathematics

Volumn 13, Issue 1, 2000, Pages 25-32

  Aldred, R E L ^a   Bau, S ^b   Holton, D A ^a   Mckay, Brendan D ^c  

^a UNIVERSITY OF OTAGO   (New Zealand)

^b INNER MONGOLIA UNIVERSITY OF FINANCE AND ECONOMICS   (China)

^c AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

Cubic; Nonhamiltonian; Planar

Indexed keywords

EID: 0010303859     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480198348665     Document Type: Article

References (14)

1. D. BARNETTE, On generating planar graphs, Discrete Math., 7 (1974), pp. 199-208.
2. J. BOSÁK, Hamiltonian lines in cubic graphs, in Proceedings of International Seminar on Graph Theory and Applications, Rome, 1966, Gordon and Breach, New York, pp. 33-46.
3. G. BRINKMANN AND A. DRESS, PentHex puzzles: A reliable and efficient top-down approach to fullerene-structure enumeration, Adv. Appl. Math., 21 (1998), pp. 473-480.
4. G. BRINKMANN AND A. DRESS, A constructive enumeration of fullerenes, J. Algorithms, 23 (1997), pp. 345-358.
5. G. BRINKMANN AND B. D. McKAY, Fast Generation of Some Classes of Planar Graphs, in preparation.
6. J. W. BUTLER, A generation procedure for the simple 3-polytopes with cyclically 5-connected graphs, Canad. J. Math., 26 (1974), pp. 686-708.
7. G. B. FAULKNER AND D. H. YOUNGER, Non-hamiltonian simple planar maps, Discrete Math., 7 (1974), pp. 67-74.
8. B. GRÜNBAUM, Convex Polytopes, John Wiley, New York, 1967.
9. D. A. HOLTON AND B. D. MCKAY, Cycles in 3-connected cubic planar graphs. II, Ars Combin., 21(A) (1986), pp. 107-114.
10. D. A HOLTON AND B. D. MCKAY, The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices, J Combin. Theory Ser. B. 45 (1988), pp. 305-319; Erratum, 47 (1989), p. 248.
11. B. D. MCKAY, Nauty User's Guide (Version 1.5), Tech. report Tr-CS-90-02, Computer Science Dept., Australian National University, Canberra, Australia, 1990.
12. B. D. MCKAY, A Fast Search Algorithm for Hamiltonian Cycles in Cubic Graphs, in preparation.
13. B. MOHAR, Search for minimal non-hamiltonian simple 3-polytopes, in Proceedings Fourth Yugoslav Seminar on Graph Theory, Novi Sad, University of Novi Sad, Institute of Mathematics, Novi Sad, 1983, pp. 191-208.
14. H. OKAMURA, Every simple 3-polytope of order 32 or less is hamiltonian, J. Graph Theory, 6 (1982), pp. 185-196.