Vertex-disjoint rainbow triangles in edge-colored graphs
From MaRDI portal
(Redirected from Publication:2005705)
Recommendations
Cites work
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- An improved bound for disjoint directed cycles
- Color degree and alternating cycles in edge-colored graphs
- Color degree and heterochromatic cycles in edge-colored graphs
- Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
- Disjoint cycles of different lengths in graphs and digraphs
- Disjoint directed cycles
- Graph theory with applications
- On the maximal number of independent circuits in a graph
- Proof of a conjecture of Henning and yeo on vertex-disjoint directed cycles
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
- Rainbow triangles in edge-colored graphs
- Vertex disjoint cycles of different length in digraphs
- Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs
Cited in
(11)- Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs
- Disjoint color-avoiding triangles
- Vertex-disjoint rainbow cycles in edge-colored graphs
- Minimum-degree conditions for rainbow triangles
- Rainbow triangles in edge-colored graphs
- Color degree sum conditions for rainbow triangles in edge-colored graphs
- Counting rainbow triangles in edge-colored graphs
- Edge-disjoint rainbow triangles in edge-colored graphs
- Disproof of a conjecture on the rainbow triangles in arc-colored digraphs
- Note on rainbow triangles in edge-colored graphs
- On graphs with a large number of edge-colorings avoiding a rainbow triangle
This page was built for publication: Vertex-disjoint 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 Q2005705)
