Coloring Problems on Bipartite Graphs of Small Diameter

by   Victor A. Campos, et al.

We investigate a number of coloring problems restricted to bipartite graphs with bounded diameter. We prove that the k-List Coloring, List k-Coloring, and k-Precoloring Extension problems are NP-complete on bipartite graphs with diameter at most d, for every k≥ 4 and every d≥ 3, and for k=3 and d≥ 4, and that List k-Coloring is polynomial when d=2 (i.e., on complete bipartite graphs) for every k ≥ 3. Since k-List Coloring was already known to be NP-complete on complete bipartite graphs, and polynomial for k=2 on general graphs, the only remaining open problems are List 3-Coloring and 3-Precoloring Extension when d=3. We also prove that the Surjective C_6-Homomorphism problem is NP-complete on bipartite graphs with diameter at most 4, answering a question posed by Bodirsky, Kára, and Martin [Discret. Appl. Math. 2012]. As a byproduct, we get that deciding whether V(G) can be partitioned into 3 subsets each inducing a complete bipartite graph is NP-complete. An attempt to prove this result was presented by Fleischner, Mujuni, Paulusma, and Szeider [Theor. Comput. Sci. 2009], but we realized that there was an apparently non-fixable flaw in their proof. Finally, we prove that the 3-Fall Coloring problem is NP-complete on bipartite graphs with diameter at most 4, and give a polynomial reduction from 3-Fall Coloring on bipartite graphs with diameter 3 to 3-Precoloring Extension on bipartite graphs with diameter 3. The latter result implies that if 3-Fall Coloring is NP-complete on these graphs, then the complexity gaps mentioned above for List k-Coloring and k-Precoloring Extension would be closed. This would also answer a question posed by Kratochvíl, Tuza, and Voigt [Proc. of WG 2002].


page 1

page 2

page 3

page 4


List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs

Given a graph G=(V, E) and a list of available colors L(v) for each vert...

A complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter

In a graph, a matching cut is an edge cut that is a matching. Matching C...

On List k-Coloring Convex Bipartite Graphs

List k-Coloring (Li k-Col) is the decision problem asking if a given gra...

Sparsification Lower Bounds for List H-Coloring

We investigate the List H-Coloring problem, the generalization of graph ...

The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs

A proper coloring of a graph is proper conflict-free if every non-isolat...

Complexity of fall coloring for restricted graph classes

We strengthen a result by Laskar and Lyle (Discrete Appl. Math. (2009), ...

Tetris is NP-hard even with O(1) rows or columns

We prove that the classic falling-block video game Tetris (both survival...

Please sign up or login with your details

Forgot password? Click here to reset