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

Gespeichert in:
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!
Beschreibung
Zusammenfassung: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. (Graphs and Combinatorics 25 (2), 153–167, 2009 ). This constitutes the first result concerning structural parameterizations of this problem. We show that the problem is FPT when parameterized by the vertex cover number on general graphs, and on chordal graphs when parameterized by the number of colors. Additionally, we observe that our algorithm for graphs of bounded clique-width can be adapted to solve the Fall Coloring problem within the same runtime bound. The running times of the clique-width based algorithms for b - Coloring and Fall Coloring are tight under the Exponential Time Hypothesis.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1432-4350
1433-0490
DOI:10.1007/s00224-023-10132-0