Note on rainbow triangles in edge-colored graphs
From MaRDI portal
Publication:2117536
DOI10.1007/S00373-022-02477-ZzbMATH Open1485.05055OpenAlexW4221024121MaRDI QIDQ2117536FDOQ2117536
Publication date: 21 March 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-022-02477-z
Recommendations
Cites Work
- Graph theory
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- Rainbow triangles in edge-colored graphs
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
- Color degree and heterochromatic cycles in edge-colored graphs
- Title not available (Why is that?)
- Transitiv orientierbare Graphen
- Rainbow generalizations of Ramsey theory: A survey
- Color degree sum conditions for rainbow triangles in edge-colored graphs
- Properly colored paths and cycles
- Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
- On the maximal number of independent triangles in graphs
- Vertex-disjoint rainbow triangles in edge-colored graphs
- Properly colored short cycles in edge-colored graphs
Cited In (4)
This page was built for publication: Note on 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 Q2117536)
