A solution of Dudeney's round table problem for an even number of people
From MaRDI portal
Publication:1207764
DOI10.1016/0097-3165(93)90022-ZzbMath0783.05033MaRDI QIDQ1207764
Gisaku Nakamura, Midori Kobayashi, Kiyasu-Zen'iti
Publication date: 23 May 1993
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
05C38: Paths and cycles
05B30: Other designs, configurations
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Double coverings of 2‐paths by Hamilton cycles*, Unnamed Item, Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking, Exact coverings of 2-paths by Hamilton cycles, Compatible Hamilton decompositions of directed wrapped butterfly graphs, Pairwise compatible Hamilton decompositions of \(K_n\), Uniform coverings of 2-paths with 5-paths in the complete graph
Cites Work