@article{oai:u-shizuoka-ken.repo.nii.ac.jp:00001789,
 author = {小林, みどり and 喜安, 善市 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 number of non-isomorphic Dudeney sets. In the previous paper, we constructed two types of new Dudeney sets using perfect 1-factorizations and determined the numbers of these Dudeney sets. In this paper, we show Dudeney sets of these types are not isomorphic, so the number of them are determined., text, application/pdf},
 pages = {1--3},
 title = {完全1因子分解から誘導されるDudeney集合について(II)},
 volume = {9},
 year = {1997},
 yomi = {コバヤシ, ミドリ and キヤス, ゼンイチ and ハヤシダ, ツヨシ}
}