Color degree sum conditions for rainbow triangles in edge-colored graphs
From MaRDI portal
(Redirected from Publication:343757)
Recommendations
Cites work
Cited in
(20)- Disproof of a conjecture on the rainbow triangles in arc-colored digraphs
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three
- Properly edge-colored theta graphs in edge-colored complete graphs
- Vertex-disjoint rainbow cycles in edge-colored graphs
- Rainbow triangles in arc-colored tournaments
- Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs
- Vertex-disjoint rainbow triangles in edge-colored graphs
- Note on rainbow triangles in edge-colored graphs
- On sufficient conditions for rainbow cycles in edge-colored graphs
- Rainbow triangles in arc-colored digraphs
- Rainbow triangles in edge-colored graphs
- Minimum-degree conditions for rainbow triangles
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
- Maximum properly colored trees in edge-colored graphs
- Grünbaum colorings extended to non-facial 3-cycles
- Color degree sum conditions for properly colored spanning trees in edge-colored graphs
- Counting rainbow triangles in edge-colored graphs
- Color degree condition for long rainbow paths in edge-colored graphs
- Rainbow triangles and cliques in edge-colored graphs
- Edge-disjoint rainbow triangles in edge-colored graphs
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)