References
Faulkner, G. B. andYounger, D. H.,Non-Hamiltonian cubic planar maps. Discrete Math.7 (1974), 67–74.
Grinberg, E. Ja.,Plane homogeneous graphs of degree three without Hamiltonian circuits (in Russian), Latvian Math. Yearbook4, pp. 51–58. Izdat. ‘Zinatne’, Riga, 1968.
Grünbaum, B.,Polytopes, graphs, and complexes. Bull. Amer. Math. Soc.76 (1970), 1131–1201.
Grünbaum, B. andWalther, H.,Shortness exponents of families of graphs. J. Combinatorial Theory Ser. A14 (1973), 364–385.
Grünbaum, B. andZaks, J.,The existence of certain planar maps. Discrete Math.10 (1974), 93–115.
Honsberger, R.,Mathematical gems. Dolciani Mathematical Expositions, Number 1. Math. Assoc. of America, Washington, D.C., 1973.
Martin, P.,Cycles Hamiltoniens dans les graphes 4-reguliers 4-connexes. Aequationes Math.14, (1975), 33–35.
Meredith, G. H. J.,Regular n-valent n-connected nonHamiltonian non-n-edge-colorable graphs. J. Combinatorial Theory Ser. B14 (1973), 55–60.
Nash-Williams, C. St.-J. A.,Possible directions in graph theory. InCombinatorial Mathematics and its Applications, D. J. A. Welsh, (ed.), Academic Press, London, 1971, pp. 191–200.
Ore, O.,Theory of graphs. Amer. Math. Soc. Colloq. Publ., Vol. 38. Providence, R.I., 1962.
Ore, O.,The four-color problem. Academic Press, New York, 1967.
Rosenfeld, M. andBarnette, D.,Hamiltonian circuits in certain prisms. Discrete Math.5 (1973), 389–394.
Tutte, W. T.,A theorem on planar graphs. Trans. Amer. Math. Soc.82 (1956), 99–116.
Author information
Authors and Affiliations
Additional information
Research partially supported by National Science Foundation Grant GP 42450.
Rights and permissions
About this article
Cite this article
Grünbaum, B., Malkevitch, J. Pairs of edge-disjoint Hamiltonian circuits. Aeq. Math. 14, 191–196 (1976). https://doi.org/10.1007/BF01836218
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01836218