Abstract
In this paper we construct a family of hypo-hamiltonian generalized prisms with 4k+2 vertices k≠1,3. This family gives us new cubic-hypohamiltonian graphs for k>5.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.A. Bondy, Variations on the Hamiltonian theorem, Canad. Math. Bull., 15(1972), 57–62.
G. Chartrand and F. Harary, Planar permutation graphs, Ann. Inst. Henri Poincare, Vol. III, no. 4(1967), 433–438.
V. Chvatál, Flip flops in hypohamiltonian graphs, Canad. Math. Bull., 16(1973), 33–42.
J. Doyen and V. VanDiest, Hypohamiltonian graphs, Discrete Math., 13(1975), 225–236.
V. Klee, Which Generalised Prisms Admit H-circuits, Lecture Notes No. 303, Springer-Verlag, 173–179.
Daljit Rao, On some transversability problems in graph theory and combinatorics (Dissertation) I.I.T., Kanpur, 1977.
G.N. Robertson, Graphs under girth, valency and connectivity constraints (Dissertation), University of Waterloo, Canada, 1968.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Mohanty, S.P., Rao, D. (1981). A family of hypo-hamiltonian generalized prisms. In: Rao, S.B. (eds) Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092278
Download citation
DOI: https://doi.org/10.1007/BFb0092278
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11151-1
Online ISBN: 978-3-540-47037-3
eBook Packages: Springer Book Archive