Vertex-disjoint rainbow triangles in edge-colored graphs
From MaRDI portal
Publication:2005705
DOI10.1016/j.disc.2020.112117zbMath1448.05075OpenAlexW3084073791MaRDI QIDQ2005705
Publication date: 8 October 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.112117
Related Items (3)
Edge-disjoint rainbow triangles in edge-colored graphs ⋮ Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs ⋮ Note on rainbow triangles in edge-colored graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
- Color degree and heterochromatic cycles in edge-colored graphs
- Color degree and alternating cycles in edge-colored graphs
- Disjoint directed cycles
- An improved bound for disjoint directed cycles
- Disjoint cycles of different lengths in graphs and digraphs
- Rainbow triangles in edge-colored graphs
- Vertex Disjoint Cycles of Different Length in Digraphs
- Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles
- Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
- Vertex‐disjoint properly edge‐colored cycles in edge‐colored complete graphs
- On the maximal number of independent circuits in a graph
This page was built for publication: Vertex-disjoint rainbow triangles in edge-colored graphs