Flexible list colorings: Maximizing the number of requests satisfied

Flexible list coloring was introduced by Dvořák, Norin, and Postle in 2019. Suppose 0 ≤ ϵ ≤ 1, G is a graph, L is a list assignment for G, and r is a function with nonempty domain D ⊆ V ( G ) such that r ( v ) ∈ L ( v ) for each v ∈ D ( r is called a request of L). The triple ( G , L , r ) is ϵ‐sati...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of graph theory 2024-10, Vol.106 (4), p.887-906
Hauptverfasser:	Kaul, Hemanshu, Mathew, Rogers, Mudrock, Jeffrey A., Pelsmajer, Michael J.
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Coloring Flexibility flexible list coloring Graphs Hall ratio list coloring list coloring with requests list packing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!