Black 1-factors and Dudeney sets

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

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Black 1-factors and Dudeney sets

Date

2010

Authors

Kobayashi, Midori

McKay, Brendan

Mutoh, Nobuaki

Nakamura, Gisaku

Publisher

Charles Babbage Research Centre

Abstract

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

Keywords

Keywords: 1-factors; Complete graphs; Hamilton cycle; Odd prime; Quadratic residues; Graph theory

URI

http://hdl.handle.net/1885/66305

Collections

ANU Research Publications

Source

Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC)

Type

Journal article

Restricted until

2037-12-31

Downloads

File

Description

01_Kobayashi_Black_1-factors_and_Dudeney_2010.pdf (317.82 KB)

Full item page

Cultural advice

Black 1-factors and Dudeney sets

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Keywords

Citation

URI

Collections

Source

Type

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until

Downloads