On sufficient conditions for rainbow cycles in edge-colored graphs
From MaRDI portal
Publication:2421861
DOI10.1016/j.disc.2019.03.012zbMath1414.05115arXiv1705.03675OpenAlexW2613648317WikidataQ128072957 ScholiaQ128072957MaRDI QIDQ2421861
Shinya Fujita, Bo Ning, Chuan-Dong Xu, Sheng Gui Zhang
Publication date: 18 June 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.03675
Related Items (9)
Vertex-disjoint rainbow cycles in edge-colored graphs ⋮ Edge-disjoint rainbow triangles in edge-colored graphs ⋮ Proper cycles and rainbow cycles in 2-triangle-free edge-colored complete graphs ⋮ Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs ⋮ Properly colored \(C_4\)'s in edge-colored graphs ⋮ Rainbow triangles and cliques in edge-colored graphs ⋮ Rainbow triangles in arc-colored tournaments ⋮ Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs ⋮ Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Color degree sum conditions for rainbow triangles in edge-colored graphs
- Rainbow generalizations of Ramsey theory: A survey
- On a theorem of Rademacher-Turán
- Rainbow cycles in edge-colored graphs
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Disjoint directed cycles
- An improved bound for disjoint directed cycles
- On some extremal problems in graph theory
- Rainbow triangles in edge-colored graphs
- Cycles in digraphs– a survey
- Edge colorings of complete graphs without tricolored triangles
- Rainbow cliques in edge-colored graphs
This page was built for publication: On sufficient conditions for rainbow cycles in edge-colored graphs