Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs
From MaRDI portal
Publication:2112656
DOI10.1016/j.dam.2022.12.020zbMath1506.05064OpenAlexW4312053018MaRDI QIDQ2112656
Tingting Han, Yan Dong Bai, Hajo J. Broersma, Sheng Gui Zhang
Publication date: 11 January 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.12.020
edge-colored complete graphproperly colored triangle and \(C_4\)total color degreetotal monochromatic degree
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
- Properly colored paths and cycles
- Rainbow cycles in edge-colored graphs
- Alternating cycles in edge-partitioned graphs
- A note on alternating cycles in edge-coloured graphs
- Properly colored \(C_4\)'s in edge-colored graphs
- Vertex-disjoint rainbow triangles in edge-colored graphs
- Rainbow triangles and cliques in edge-colored graphs
- Properly colored short cycles in edge-colored graphs
- On sufficient conditions for rainbow cycles in edge-colored graphs
- Rainbow triangles in edge-colored graphs
- Edge colorings of complete graphs without tricolored triangles
- Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
- Local Anti-Ramsey Numbers of Graphs
- A complete bipartite graph without properly colored cycles of length four
- A rainbow version of Mantel's Theorem
- Transitiv orientierbare Graphen
This page was built for publication: Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs
