@article{oai:u-shizuoka-ken.repo.nii.ac.jp:00001832,
 author = {小林, みどり and 武藤, 伸明 and 喜安, 善市 and 中村, 義作},
 issue = {1},
 journal = {経営と情報 : 静岡県立大学・経営情報学部/学報},
 month = {Nov},
 note = {A set of Hamilton cycles in the complete graph K_n is called a [double] Dudeney set, if every path of length two lies on exactly one [two] of the cycles. It has been conjectured that there is a Dudeney set for every complete graph. It is known that there exists a Dudeney set of K_n when n is even, but it is still unsettled when n is odd. In this paper, we define a black 1-factor and we show that if there exists a black 1-factor of K_n, we can construct a Dudeney set of K_<n+1>. Furthermore, we extend it to a double Dudeney set., text, application/pdf},
 pages = {69--76},
 title = {黒色1因子とDudeney集合(大坪檀教授退任記念号)},
 volume = {11},
 year = {1998},
 yomi = {コバヤシ, ミドリ and ムトウ, ノブアキ and キヤス, ゼンイチ and ナカムラ, ギサク}
}