Double coverings of 2‐paths by Hamilton cycles*

DOI10.1002/JCD.10003zbMath0997.05056OpenAlexW2124331929MaRDI QIDQ4537566

Nobuaki Mutoh, Kiyasu-Zen'iti, Gisaku Nakamura, Midori Kobayashi

Publication date: 1 July 2002

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.10003

zbMATH Keywords

Hamilton cycles2-pathround table problemdouble Dudeney set

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Dudeney's round table problem
• Exact coverings of 2-paths by Hamilton cycles
• A solution of Dudeney's round table problem for an even number of people
• Pairwise compatible Hamilton decompositions of \(K_n\)
• Covering 2-paths uniformly

This page was built for publication: Double coverings of 2‐paths by Hamilton cycles*