A solution of Dudeney's round table problem for an even number of people

DOI10.1016/0097-3165(93)90022-ZzbMath0783.05033OpenAlexW2021048097MaRDI QIDQ1207764

Midori Kobayashi, Gisaku Nakamura, Kiyasu-Zen'iti

Publication date: 23 May 1993

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(93)90022-z

zbMATH Keywords

complete graphHamilton cycles2-pathround table

Mathematics Subject Classification ID

Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

Double coverings of 2‐paths by Hamilton cycles* ⋮ Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking ⋮ Pairwise compatible Hamilton decompositions of \(K_n\) ⋮ Covering 2-paths uniformly ⋮ Exact coverings of 2-paths by Hamilton cycles ⋮ Compatible Hamilton decompositions of directed wrapped butterfly graphs ⋮ Uniform coverings of 2-paths with 5-paths in the complete graph

Cites Work

• A perfect one-factorization of \(K_{36}\)
• Exact coverings of 2-paths by 4-cycles
• Dudeney's round table problem
• Resolvable coverings of 2-paths by 4-cycles
• Exact coverings of 2-paths by Hamilton cycles
• Symmetry groups of some perfect 1-factorizations of complete graphs
• Unnamed Item

This page was built for publication: A solution of Dudeney's round table problem for an even number of people