The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors (Q1876686): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2003.11.031 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968128554 / rank | |||
Normal rank | |||
Revision as of 18:09, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors |
scientific article |
Statements
The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors (English)
0 references
20 August 2004
0 references
The Hamilton-Waterloo problem asks for a 2-factorization of the complete graph \(K_{2n+1}\) where \(r\) of the factors are isomorphic to a given 2-factor \(Q\), and \(s\) of the factors are isomorphic to a given 2-factor \(R\). The present paper deals with the version where \(Q\) is a Hamiltonian cycle, and \(R\) is the disjoint union of triangles.
0 references
2-Factorizations
0 references
