著者

小林 みどり 喜安 善市

出版者

静岡県立大学

雑誌

経営と情報 : 静岡県立大学・経営情報学部/学報 (ISSN:09188215)

巻号頁・発行日

vol.8, no.2, pp.13-32, 1996-03-31

---

A set of Hamilton cycles in the complete graph on n vertices is called a Dudeney set, if every path of length two lies on exactly one of the cycles. It has been conjectured that there is a Dudeney set for every complete graph, but it is still unsettled. Furthermore, little is known about the numder of non -isomorphic Dudeney sets. In this paper, we construct non-isomorphic Dudeney sets using perfect 1-factorizations and determine the number of the Dudeney sets and the automorphism groups.