Symmetric Hamilton cycle decompositions of the complete graph
From MaRDI portal
Publication:4452466
DOI10.1002/jcd.10066zbMath1031.05100OpenAlexW2015805499MaRDI QIDQ4452466
Midori Kobayashi, Jin Akiyama, 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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (9)
Hamiltonian Cycle Systems Which Are Both Cyclic and Symmetric ⋮ Rainbow subgraphs in Hamiltonian cycle decompositions of complete graphs ⋮ On the full automorphism group of a Hamiltonian cycle system of odd order ⋮ A tripling construction for mutually orthogonal symmetric hamiltonian double Latin squares ⋮ Optimal Bounds for Disjoint Hamilton Cycles in Star Graphs ⋮ Inventory rebalancing and vehicle routing in bike sharing systems ⋮ Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor ⋮ Some Results on 1‐Rotational Hamiltonian Cycle Systems ⋮ \(\phi\)-symmetric Hamilton cycle decompositions of graphs
This page was built for publication: Symmetric Hamilton cycle decompositions of the complete graph
