Rainbow subgraphs in Hamiltonian cycle decompositions of complete graphs
From MaRDI portal
Publication:6041575
DOI10.1016/j.disc.2023.113479zbMath1515.05105MaRDI QIDQ6041575
Publication date: 31 May 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Hamiltonian decompositions of complete graphs
- Size Ramsey numbers involving stars
- The size Ramsey number
- Towards the linear arboricity conjecture
- The conjunction of the linear arboricity conjecture and Lovász's path partition theorem
- On the multicolor size Ramsey number of stars and cliques
- Light structures in 1-planar graphs with an application to linear 2-arboricity
- Covering and packing in graphs IV: Linear arboricity
- Symmetric Hamilton cycle decompositions of the complete graph
- Size Ramsey numbers of stars versus cliques
- The list linear arboricity of graphs