Group Colorings and DP-Colorings of Multigraphs Using Edge-Disjoint Decompositions

In (J Graph Theory 4:241–242, 1980), Burr proved that χ ( G ) ≤ m 1 m 2 … m k if and only if G is the edge-disjoint union of k graphs G 1 , G 2 , … , G k such that χ ( G i ) ≤ m i for 1 ≤ i ≤ k . This result established the practice of describing the chromatic number of a graph G which is the edge-d...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Graphs and combinatorics 2021, Vol.37 (6), p.2227-2243
Hauptverfasser:	Lai, Hong-Jian, Mazza, Lucian
Format:	Artikel
Sprache:	eng
Schlagworte:	Coloring Combinatorics Engineering Design Graph theory Graphs Mathematics Mathematics and Statistics Original Paper Theorems
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!