AI Chat AI Image Generator AI Video Text to Speech

b-Coloring Parameterized by Pathwidth is XNLP-complete

09/16/2022

∙

by Lars Jaffke, et al.

∙

∙

We show that the b-Coloring problem is complete for the class XNLP when parameterized by the pathwidth of the input graph. Besides determining the precise parameterized complexity of this problem, this implies that b-Coloring parameterized by pathwidth is W[t]-hard for all t, and resolves the parameterized complexity of b-Coloring parameterized by treewidth.

Lars Jaffke
22 publications
Paloma T. Lima
20 publications
Roohani Sharma
18 publications

page 1

page 2

page 3

page 4

research

∙ 10/23/2019

Parameterized Coloring Problems on Threshold Graphs

In this paper, we study several coloring problems on graphs from the vie...

0 I. Vinod Reddy, et al. ∙

research

∙ 08/17/2020

Grundy Distinguishes Treewidth from Pathwidth

Structural graph parameters, such as treewidth, pathwidth, and clique-wi...

0 Rémy Belmonte, et al. ∙

research

∙ 10/13/2020

Digraph Coloring and Distance to Acyclicity

In k-Digraph Coloring we are given a digraph and are asked to partition ...

0 Ararat Harutyunyan, et al. ∙

research

∙ 11/30/2020

Homology Localization Through the Looking-Glass of Parameterized Complexity Theory

Finding a cycle of lowest weight that represents a homology class in a s...

0 Nello Blaser, et al. ∙

research

∙ 06/23/2022

On the Complexity of Problems on Tree-structured Graphs

In this paper, we introduce a new class of parameterized problems, which...

0 Hans L. Bodlaender, et al. ∙

research

∙ 01/10/2019

On the Descriptive Complexity of Color Coding

Color coding is an algorithmic technique used in parameterized complexit...

0 Max Bannach, et al. ∙

research

∙ 10/30/2018

Parameterized Complexity of Equitable Coloring

A graph on n vertices is equitably k-colorable if it is k-colorable and ...

0 Guilherme de C. M. Gomes, et al. ∙