b-Coloring Parameterized by Clique-Width
-
Published:2023-09-23
Issue:
Volume:
Page:
-
ISSN:1432-4350
-
Container-title:Theory of Computing Systems
-
language:en
-
Short-container-title:Theory Comput Syst
Author:
Jaffke LarsORCID, Lima Paloma T., Lokshtanov Daniel
Abstract
AbstractWe 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 $$\textsf{FPT}$$
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$$
b
-Coloring and Fall Coloring are tight under the Exponential Time Hypothesis.
Funder
University of Bergen
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference59 articles.
1. Aboulker, P., Bonnet, É., Kim, E.J., Sikora, F.: Grundy coloring & friends, half-graphs, bicliques. In: STACS 2020, LIPIcs, vol. 154, pp. 58:1–58:18 (2020) 2. Bandelt, H.J., Mulder, H.M.: Distance-hereditary graphs. J. Comb. Theory. Ser. B 41, 182–208 (1986) 3. Belmonte, R., Kim, E.J., Lampis, M., Mitsou, V., Otachi, Y.: Grundy distinguishes treewidth from pathwidth. In: ESA 2020, LIPIcs, vol. 173, pp. 14:1–14:19 (2020) 4. Blair, J.R., Peyton, B.: An introduction to chordal graphs and clique trees. In: Graph theory and sparse matrix computation, pp. 1–29. Springer, (1993) 5. Bonomo, F., Durán, G., Maffray, F., Marenco, J., Valencia-Pabon, M.: On the b-coloring of cographs and $$P_4$$-sparse graphs. Graphs and Combinatorics 25(2), 153–167 (2009)
|
|