Dudeney's round table problem

DOI10.1016/0012-365X(91)90272-4zbMath0762.05056MaRDI QIDQ1182929

Gisaku Nakamura, Midori Kobayashi, Katherine Heinrich

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

complete graphHamilton cyclesDudeney setround table problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

Double coverings of 2‐paths by Hamilton cycles* ⋮ Pairwise compatible Hamilton decompositions of \(K_n\) ⋮ Covering 2-paths uniformly ⋮ Exact coverings of 2-paths by Hamilton cycles ⋮ A solution of Dudeney's round table problem for an even number of people ⋮ Compatible Hamilton decompositions of directed wrapped butterfly graphs ⋮ Decompositions of line graphs of complete graphs into paths and cycles

Cites Work

• Exact coverings of 2-paths by 4-cycles
• Some new perfect one-factorizations from starters in finite fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dudeney's round table problem