Color degree sum conditions for rainbow triangles in edge-colored graphs
From MaRDI portal
Publication:343757
DOI10.1007/S00373-016-1690-2zbMATH Open1349.05112OpenAlexW2322878011MaRDI QIDQ343757FDOQ343757
Ruonan Li, Shenggui Zhang, Bo Ning
Publication date: 29 November 2016
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-016-1690-2
Recommendations
Cites Work
Cited In (15)
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
- Properly edge-colored theta graphs in edge-colored complete graphs
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three
- Vertex-disjoint rainbow cycles in edge-colored graphs
- Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs
- Rainbow triangles in arc-colored tournaments
- Color degree condition for long rainbow paths in edge-colored graphs
- Color degree sum conditions for properly colored spanning trees in edge-colored graphs
- Edge-disjoint rainbow triangles in edge-colored graphs
- Maximum properly colored trees in edge-colored graphs
- Grünbaum colorings extended to non-facial 3-cycles
- Disproof of a conjecture on the rainbow triangles in arc-colored digraphs
- On sufficient conditions for rainbow cycles in edge-colored graphs
- Note on rainbow triangles in edge-colored graphs
- Rainbow triangles in arc-colored digraphs
This page was built for publication: Color degree sum conditions for rainbow triangles in edge-colored graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q343757)