Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs
From MaRDI portal
Publication:2422235
DOI10.1016/j.ejc.2019.02.008zbMath1414.05174arXiv1706.04950OpenAlexW2963265512WikidataQ128228675 ScholiaQ128228675MaRDI QIDQ2422235
Publication date: 18 June 2019
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.04950
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Related Items (11)
Almost all optimally coloured complete graphs contain a rainbow Hamilton path ⋮ Properly colored cycles of different lengths in edge-colored complete graphs ⋮ Long directed rainbow cycles and rainbow spanning trees ⋮ Hamilton transversals in random Latin squares ⋮ A rainbow blow‐up lemma ⋮ Rainbow structures in locally bounded colorings of graphs ⋮ Template-driven rainbow coloring of proper interval graphs ⋮ Template-driven rainbow coloring of proper interval graphs ⋮ Rainbow Cycles in Flip Graphs ⋮ Properly colored short cycles in edge-colored graphs ⋮ Rainbow Cycles in Flip Graphs.
Cites Work
- Unnamed Item
- Unnamed Item
- Edge-disjoint rainbow spanning trees in complete graphs
- Linearly many rainbow trees in properly edge-coloured complete graphs
- Rainbow spanning trees in properly coloured complete graphs
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
- Long heterochromatic paths in edge-colored graphs
- Rainbow and orthogonal paths in factorizations ofKn
- Hamilton circuits with many colours in properly edge-coloured complete graphs.
- Multicolored trees in complete graphs
- A lower bound for the length of a partial transversal in a Latin square
This page was built for publication: Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs
