Adaptable and conflict colouring multigraphs with no cycles of length three or four

The adaptable choosability of a multigraph G $G$, denoted cha(G) ${\text{ch}}_{a}(G)$, is the smallest integer k $k$ such that any edge labelling, τ $\tau $, of G $G$ and any assignment of lists of size k $k$ to the vertices of G $G$ permits a list colouring, σ $\sigma $, of G $G$ such that there is...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of graph theory 2023-09, Vol.104 (1), p.188-219
Hauptverfasser:	Aliaj, Jurgen, Molloy, Michael
Format:	Artikel
Sprache:	eng
Schlagworte:	adaptable colouring Apexes Coloring conflict colouring Graph theory high‐girth graphs probabilistic method
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!