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...

Celý popis

Podrobná bibliografia

Vydané v:	Acta informatica Ročník 62; číslo 2; s. 24
Hlavní autori:	Bliznets, Ivan, Nederlof, Jesper
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2025 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!