The Hamilton‐Waterloo problem for Hamilton cycles and triangle‐factors
Hongchuan Lei, Hao Shen
Abstract
Hongchuan Lei, Hao Shen
Abstract
Abstract In this article, we consider the Hamilton‐Waterloo problem for the case of Hamilton cycles and triangle‐factors when the order of the complete graph Kn is even. We completely solved the problem for the case n≡24 (mod 36). For the cases n≡0 (mod 18) and n≡6 (mod 36), we gave an almost complete solution. © 2012 Wiley Periodicals, Inc. J. Combin. Designs 20: 305–316, 2012
OpenAlex reports 19 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract In this article, we consider the Hamilton‐Waterloo problem for the case of Hamilton cycles and triangle‐factors when the order of the complete graph Kn is even. We completely solved the problem for the case n≡24 (mod 36). For the cases n≡0 (mod 18) and n≡6 (mod 36), we gave an almost complete solution. © 2012 Wiley Periodicals, Inc. J. Combin. Designs 20: 305–316, 2012
Key concepts: Combinatorics, Hamiltonian path, Mathematics, Mod, Complete graph, NP-complete, Order (exchange), Graph