The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
From MaRDI portal
Publication:3619608
DOI10.1002/jcd.20196zbMath1204.05074OpenAlexW2159761631MaRDI QIDQ3619608
Jeffrey H. Dinitz, Alan C. H. Ling
Publication date: 8 April 2009
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20196
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items
The Hamilton-Waterloo problem for Hamilton cycles and triangle-factors, A cyclic solution for an infinite class of Hamilton-Waterloo problems, Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles, Cyclic balanced sampling plans excluding contiguous units with block size four, On bipartite 2-factorizations of kn − I and the Oberwolfach problem, The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles, A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors, Hamilton cycle rich 2-factorization of complete equipartite graphs. II, Uniformly resolvable cycle decompositions with four different factors, A blow-up lemma for approximate decompositions, The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors, Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem, On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors, Unnamed Item, The Hamilton-Waterloo problem for triangle-factors and heptagon-factors, Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices, On the generalized Oberwolfach problem, Unnamed Item, Two-dimensional balanced sampling plans avoiding adjacent units
Cites Work
