Rainbow subgraphs in Hamiltonian cycle decompositions of complete graphs

DOI10.1016/J.DISC.2023.113479MaRDI QIDQ6041575zbMATH OpenFDO

Authors Yu-Chen Liu, Yaojun Chen

Publication date 31 May 2023

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2023.113479

zbMATH Keywords

Hamiltonian cycle decompositionrainbow subgraphrestricted size Ramsey number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45) Generalized Ramsey theory (05C55) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Ramsey theory (05D10)

Recommendations

• Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations
• Rainbow Hamiltonian cycles in strongly edge-colored graphs
• On rainbow cycles in edge colored complete graphs
• Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
• Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs

Cites work

• Covering and packing in graphs IV: Linear arboricity
• Hamiltonian decompositions of complete graphs
• scientific article; zbMATH DE number 3724483 (Why is no real title available?)
• scientific article; zbMATH DE number 3458660 (Why is no real title available?)
• Light structures in 1-planar graphs with an application to linear 2-arboricity
• On the multicolor size Ramsey number of stars and cliques
• Size Ramsey numbers involving stars
• Size Ramsey numbers of stars versus cliques
• Symmetric Hamilton cycle decompositions of the complete graph
• The conjunction of the linear arboricity conjecture and Lovász's path partition theorem
• The list linear arboricity of graphs
• The size Ramsey number
• Towards the linear arboricity conjecture

Cited in

(1)

• A conjecture on rainbow Hamiltonian cycle decomposition

This page was built for publication: Rainbow subgraphs in Hamiltonian cycle decompositions of complete graphs

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