
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.
2-Factorizations, Eulerian and Hamiltonian graphs, Hamiltonian cycle, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Triangle-factor, Discrete Mathematics and Combinatorics, Theoretical Computer Science
2-Factorizations, Eulerian and Hamiltonian graphs, Hamiltonian cycle, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Triangle-factor, Discrete Mathematics and Combinatorics, Theoretical Computer Science
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 22 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
