Double coverings of 2‐paths by Hamilton cycles*

DOI10.1002/JCD.10003MaRDI QIDQ4537566zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Cycle double covers of graphs with Hamilton paths
• Exact coverings of 2-paths by Hamilton cycles
• Publication:4489190
• More orthogonal double covers of complete graphs by Hamiltonian paths
• A class of 2-colorable orthogonal double covers of complete graphs by Hamiltonian paths
• Publication:4863464
• scientific article; zbMATH DE number 617579
• Hamilton cycles in double generalized Petersen graphs
• Hamiltonian coverings of some graphs
• Double cycle covers and the petersen graph

Cites work

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

Cited in

(4)

• scientific article; zbMATH DE number 1833077 (Why is no real title available?)
• Black 1-factors and Dudeney sets
• Some basic properties of multiple Hamiltonian covers
• Resolvable coverings of 2-paths by cycles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537566)