Note on Rainbow Triangles in Edge-Colored Graphs

Let G be a graph with an edge-coloring c , and let δ c ( G ) denote the minimum color-degree of G . A subgraph of G is called rainbow if any two edges of the subgraph have distinct colors. In this paper, we consider color-degree conditions for the existence of rainbow triangles in edge-colored graph...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Graphs and combinatorics 2022-06, Vol.38 (3), Article 69
Hauptverfasser:	Chen, Xiaozheng, Li, Xueliang, Ning, Bo
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Engineering Design Graph coloring Graph theory Graphs Mathematics Mathematics and Statistics Original Paper
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!