Skip navigation
Skip navigation

Black 1-factors and Dudeney sets

Kobayashi, Midori; McKay, Brendan; Mutoh, Nobuaki; Nakamura, Gisaku

Description

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

CollectionsANU Research Publications
Date published: 2010
Type: Journal article
URI: http://hdl.handle.net/1885/66305
Source: Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC)

Download

File Description SizeFormat Image
01_Kobayashi_Black_1-factors_and_Dudeney_2010.pdf317.82 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator