b-Coloring Parameterized by Clique-Width

We provide a polynomial-time algorithm for b -Coloring on graphs of constant clique-width. This unifies and extends nearly all previously known polynomial time results on graph classes, and answers open questions posed by Campos and Silva (Algorithmica 80 (1), 104–115, 2018 ) and Bonomo et al. (Grap...

Full description

Bibliographic Details

Published in:	Theory of computing systems Vol. 68; no. 4; pp. 1049 - 1081
Main Authors:	Jaffke, Lars, Lima, Paloma T., Lokshtanov, Daniel
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.08.2024 Springer Nature B.V
Subjects:	Algorithms Coloring Combinatorial analysis Computer Science Graph coloring Graphs Hypotheses Parameterization Polynomials Theory of Computation Vertex cover B-coloring Structural parameterization Clique-width
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!