Hamilton decompositions of Cartesian products of graphs (Q1175987)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hamilton decompositions of Cartesian products of graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hamilton decompositions of Cartesian products of graphs |
scientific article |
Statements
Hamilton decompositions of Cartesian products of graphs (English)
0 references
25 June 1992
0 references
Jean-Claude Bermond conjectured in 1978 that, if two graphs are decomposable into Hamiltonian cycles, then so is their Cartesian product. In this paper the conjecture is verified in so many cases that a complete solution seems to be within reach. For example, the conjecture is true if both graphs are decomposable into at least three Hamiltonian cycles.
0 references
Hamilton decompositions
0 references
cartesian products
0 references
Hamiltonian cycles
0 references
0 references
