Vertex-disjoint rainbow triangles in edge-colored graphs
From MaRDI portal
Publication:2005705
DOI10.1016/J.DISC.2020.112117zbMATH Open1448.05075OpenAlexW3084073791MaRDI QIDQ2005705FDOQ2005705
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
Recommendations
Cites Work
- Title not available (Why is that?)
- On the maximal number of independent circuits in a graph
- Rainbow triangles in edge-colored graphs
- Title not available (Why is that?)
- 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
- Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
- Disjoint directed cycles
- Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles
- An improved bound for disjoint directed cycles
- Disjoint cycles of different lengths in graphs and digraphs
- Vertex disjoint cycles of different length in digraphs
- Vertex‐disjoint properly edge‐colored cycles in edge‐colored complete graphs
Cited In (6)
- Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete 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)
