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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory of computing systems Jg. 68; H. 4; S. 1049 - 1081
Hauptverfasser:	Jaffke, Lars, Lima, Paloma T., Lokshtanov, Daniel
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.08.2024 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!