Symmetric Hamilton cycle decompositions of the complete graph

DOI10.1002/JCD.10066zbMATH Open1031.05100OpenAlexW2015805499MaRDI QIDQ4452466FDOQ4452466

Authors: Jin Akiyama, Midori Kobayashi, Gisaku Nakamura 

Publication date: 12 February 2004

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.10066

zbMATH Keywords

decompositionHamilton cyclecomplete graph

Mathematics Subject Classification ID

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

Cited In (10)

• Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor
• A tripling construction for mutually orthogonal symmetric Hamiltonian double Latin squares
• Rainbow subgraphs in Hamiltonian cycle decompositions of complete graphs
• Hamiltonian cycle systems which are both cyclic and symmetric
• Inventory rebalancing and vehicle routing in bike sharing systems
• \(\phi\)-symmetric Hamilton cycle decompositions of graphs
• On cyclic symmetric Hamilton cycle decompositions of complete multipartite graphs
• On the full automorphism group of a Hamiltonian cycle system of odd order
• Optimal bounds for disjoint Hamilton cycles in star graphs
• Some results on 1-rotational Hamiltonian cycle systems

This page was built for publication: Symmetric Hamilton cycle decompositions of the complete graph

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