Exact and parameterized algorithms for choosability

In the C hoosability problem (or list chromatic number problem), for a given graph G , we need to find the smallest k such that G admits a list coloring for any list assignment where all lists contain at least k colors. The problem is tightly connected with the well-studied C oloring and L ist C olo...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Acta informatica Jg. 62; H. 2; S. 24
Hauptverfasser:	Bliznets, Ivan, Nederlof, Jesper
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2025 Springer Nature B.V
Schlagworte:	Algorithms Apexes Coloring Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Information Systems and Communication Service Logics and Meanings of Programs Lower bounds Parameterization Polynomials Software Engineering/Programming and Operating Systems Theory of Computation Upper bounds
ISSN:	0001-5903, 1432-0525
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!