@article{oai:u-shizuoka-ken.repo.nii.ac.jp:00001762,
 author = {小林, みどり and 喜安, 善市},
 issue = {2},
 journal = {経営と情報 : 静岡県立大学・経営情報学部/学報},
 month = {Mar},
 note = {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., text, application/pdf},
 pages = {13--32},
 title = {完全1因子分解から誘導されるDudeney集合について(中村義作教授退任記念号)},
 volume = {8},
 year = {1996},
 yomi = {コバヤシ, ミドリ and キヤス, ゼンイチ}
}