Black 1-factors and Dudeney sets
A set of Hamilton cycles in the complete graph Kn 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. It is known that there exists a Dudeney
|Collections||ANU Research Publications|
|Source:||Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC)|
|01_Kobayashi_Black_1-factors_and_Dudeney_2010.pdf||317.82 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.