Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Dudeney’s Round Table Problem – a Survey

Midori Kobayashi1, Gisaku Nakamura1, Keiko Kotani2, Nobuaki Mutoh1
1University of Shizuoka, Shizuoka, 422-8526 Japan
2Tokyo University of Science, Tokyo, 162-8601 Japan
  • Published: 30/06/2019

Abstract

We survey Dudeney’s round table problem which asks for a set of Hamilton cycles in the complete graph that uniformly covers the 2-paths of the graph. The problem was proposed about one hundred years ago but it is still unsettled. We mention the history of the problem, known results, gener-alizations, related designs, and some open problems.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Midori Kobayashi, Gisaku Nakamura, Keiko Kotani, Nobuaki Mutoh. Dudeney’s Round Table Problem – a Survey[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 109. -. DOI: .