Hostname: page-component-7dd5485656-gs9qr Total loading time: 0 Render date: 2025-10-31T06:12:48.247Z Has data issue: false hasContentIssue false
  • English
  • Français

Hamiltonian Cycles in Products of Graphs

Published online by Cambridge University Press:  20 November 2018

Joseph Zaks
Joseph Zaks*
Affiliation:
Michigan State University, East Lansing, Mich., U.S.A.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let V(G) and E(G) denote the vertex set and the edge set of a graph G; let Kn denote the complete graph with n vertices and let Kn, m denote the complete bipartite graph on n and m vertices. A Hamiltonian cycle (Hamiltonian path, respectively) in a graph G is a cycle (path, respectively) in G that contains all the vertices of G.

Information

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 17 , Issue 5 , February 1975 , pp. 763 - 765
Copyright
Copyright © Canadian Mathematical Society 1975

References

1. Barnette, D., Trees in Polyhedral graphs, Canad. J. Math. 18 (1966), 731–736.Google Scholar
2. Behzad, M. and Mahmoudin, S. E., On Topological Invariants of the Products of Graphs, Canad. Math. Bull. 12 (1969), 157–166.Google Scholar
3. Brown, T. A., Simple paths on Convex Polyhedra, Pacific J. Math. 11 (1961), 1211–1214.Google Scholar
4. Grunbaum, B., Convex Poly topes, J. Wiley, New York, 1967.Google Scholar
5. Rosenfeld, M. and Barnette, D., Hamiltonian Circuits in Certain Prisms, Discrete Math. 5 (1973), 389–394.Google Scholar
6. Sabidussi, G., Graphs with given group and given graph-theoretical properties, Canad. J. Math. 9 (1957), 515–525.Google Scholar
7. Sabidussi, G., Graph Multiplication, Math. Z. 72 (1960), 446–457.Google Scholar