Hamilton decompositions of Cartesian products of graphs (Q1175987): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Richard A. Stong / rank | |||
| Property / author | |||
| Property / author: Richard A. Stong / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Décomposition de \(K_ m\) + \(K_ n\) en cycles hamiltoniens / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Décomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hamiltonian decompositions of products of cycles / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:06, 15 May 2024
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
