Abstract
In this paper it is shown that certain families of simple 4-polytopes have a Hamilton decomposition, that is, the edges of these polytopes can be partitioned into two Hamilton cycles.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Gale, D.: Neighborly and cyclic polytopes. Convexity. Proc. Symp. Pure Math.7, 225–232 (1963)
Grünbaum, B.: Polytopes, graphs and complexes. Bull. Amer. Math. Soc.76, 1131–1201 (1970)
Klee, V.: Paths on polyhedra II. Pacific J. Math.17, 249–262 (1966)
Rosenfeld, M., Barnette, D.: Hamiltonian circuits in certain prisms. Discrete Math.5, 389–394 (1973)
Author information
Authors and Affiliations
Additional information
This research was partially supported by N.S.E.R.C. under Grant A-4792.
Rights and permissions
About this article
Cite this article
Alspach, B., Rosenfeld, M. On Hamilton decompositions of prisms over simple 3-polytopes. Graphs and Combinatorics 2, 1–8 (1986). https://doi.org/10.1007/BF01788070
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01788070