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

Celý popis

Podrobná bibliografia

Vydané v:	Theory of computing systems Ročník 68; číslo 4; s. 1049 - 1081
Hlavní autori:	Jaffke, Lars, Lima, Paloma T., Lokshtanov, Daniel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.08.2024 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!