3-perfect hamiltonian decomposition of the complete graph
Kobayashi, Midori; McKay, Brendan; Mutoh, Nobuaki; Nakamura, Gisaku; Nara, Chie
Description
Let n ≥ 5 be an odd integer and Kn the complete graph on n vertices. Let i be an integer with 2 ≤ i ≤ (n-1)/2. A hamiltonian decomposition H of Kn is called i-perfect if the set of the chords at distance i of the hamiltonian cycles in H is the edge
Collections | ANU Research Publications |
---|---|
Date published: | 2013 |
Type: | Journal article |
URI: | http://hdl.handle.net/1885/72849 |
Source: | Australasian Journal of Combinatorics |
Access Rights: | Open Access |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
01_Kobayashi_3-perfect_hamiltonian_2013.pdf | 3.03 MB | Adobe PDF |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator