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

Full description

Bibliographic Details

Published in:	Acta informatica Vol. 62; no. 2; p. 24
Main Authors:	Bliznets, Ivan, Nederlof, Jesper
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2025 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!