\(\phi\)-symmetric Hamilton cycle decompositions of graphs
From MaRDI portal
Publication:2344788
DOI10.1016/j.disc.2015.04.008zbMath1311.05166OpenAlexW2087289109MaRDI QIDQ2344788
Publication date: 18 May 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.04.008
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (1)
Cites Work
- A non-existence result on cyclic cycle-decompositions of the cocktail party graph
- On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
- Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
- Hamiltonian Cycle Systems Which Are Both Cyclic and Symmetric
- Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor
- Symmetric Hamilton cycle decompositions of the complete graph
- Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph
- Some Results on 1‐Rotational Hamiltonian Cycle Systems
- Symmetric Hamilton cycle decompositions of complete multigraphs
- A Combinatorial Problem on Abelian Groups
- Unnamed Item
- Unnamed Item
This page was built for publication: \(\phi\)-symmetric Hamilton cycle decompositions of graphs