3-Perfect hamiltonian decomposition of the complete graph

MaRDI QIDQ2848739zbMATH OpenFDO

Authors Midori Kobayashi, Brendan D. McKay, Nobuaki Mutoh, Gisaku Nakamura, Chie Nara

Publication date 26 September 2013

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

graphHamiltonian cycleHamiltonian decomposition

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Hamilton decomposition of complete 3-uniform hypergraphs
• scientific article; zbMATH DE number 91008
• Decompositions of complete graphs into triangles and Hamilton cycles
• Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars
• Hamilton decompositions of complete 3-uniform hypergraphs

Cited in

(3)

• Hamiltonian cycle systems which are both cyclic and symmetric
• Some results on 1-rotational Hamiltonian cycle systems
• New \(i\)-perfect cycle decompositions via vertex colorings of graphs

This page was built for publication: 3-Perfect hamiltonian decomposition of the complete graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848739)