Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor
From MaRDI portal
Publication:3072529
DOI10.1002/jcd.20257zbMath1205.05175OpenAlexW1964901889MaRDI QIDQ3072529
Richard A. Brualdi, Michael William Schroeder
Publication date: 4 February 2011
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20257
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items
Hamiltonian Cycle Systems Which Are Both Cyclic and Symmetric, On the full automorphism group of a Hamiltonian cycle system of odd order, Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph, Some Results on 1‐Rotational Hamiltonian Cycle Systems, \(\phi\)-symmetric Hamilton cycle decompositions of graphs, The structure of 2-pyramidal 2-factorizations
Cites Work
