Article contents
Hamiltonian Cycles in Products of Graphs
Published online by Cambridge University Press: 20 November 2018
Extract
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1975
References
- 7
- Cited by