Log In Sign Up

Sparsification Lower Bounds for List H-Coloring

by   Hubie Chen, et al.

We investigate the List H-Coloring problem, the generalization of graph coloring that asks whether an input graph G admits a homomorphism to the undirected graph H (possibly with loops), such that each vertex v ∈ V(G) is mapped to a vertex on its list L(v) ⊆ V(H). An important result by Feder, Hell, and Huang [JGT 2003] states that List H-Coloring is polynomial-time solvable if H is a so-called bi-arc graph, and NP-complete otherwise. We investigate the NP-complete cases of the problem from the perspective of polynomial-time sparsification: can an n-vertex instance be efficiently reduced to an equivalent instance of bitsize O(n^2-ε) for some ε > 0? We prove that if H is not a bi-arc graph, then List H-Coloring does not admit such a sparsification algorithm unless NP ⊆ coNP/poly. Our proofs combine techniques from kernelization lower bounds with a study of the structure of graphs H which are not bi-arc graphs.


page 1

page 2

page 3

page 4


Complexity of the list homomorphism problem in hereditary graph classes

A homomorphism from a graph G to a graph H is an edge-preserving mapping...

Complexity of C_k-coloring in hereditary classes of graphs

For a graph F, a graph G is F-free if it does not contain an induced sub...

Choosability in bounded sequential list coloring

The list coloring problem is a variation of the classical vertex colorin...

The polynomial method for list-colouring extendability of outerplanar graphs

We restate theorems of Hutchinson on list-colouring extendability for ou...

Coloring Problems on Bipartite Graphs of Small Diameter

We investigate a number of coloring problems restricted to bipartite gra...

Sorting Balls and Water: Equivalence and Computational Complexity

Various forms of sorting problems have been studied over the years. Rece...

Dual parameterization of Weighted Coloring

Given a graph G, a proper k-coloring of G is a partition c = (S_i)_i∈ [1...