Log In Sign Up

Complexity of C_k-coloring in hereditary classes of graphs

by   Maria Chudnovsky, et al.

For a graph F, a graph G is F-free if it does not contain an induced subgraph isomorphic to F. For two graphs G and H, an H-coloring of G is a mapping f:V(G)→ V(H) such that for every edge uv∈ E(G) it holds that f(u)f(v)∈ E(H). We are interested in the complexity of the problem H- Coloring, which asks for the existence of an H-coloring of an input graph G. In particular, we consider H- Coloring of F-free graphs, where F is a fixed graph and H is an odd cycle of length at least 5. This problem is closely related to the well known open problem of determining the complexity of 3- Coloring of P_t-free graphs. We show that for every odd k ≥ 5 the C_k- Coloring problem, even in the list variant, can be solved in polynomial time in P_9-free graphs. The algorithm extends for the case of list version of C_k- Coloring, where k is an even number of length at least 10. On the other hand, we prove that if some component of F is not a subgraph of a subdividecd claw, then the following problems are NP-complete in F-free graphs: a)extension version of C_k- Coloring for every odd k ≥ 5, b) list version of C_k- Coloring for every even k ≥ 6.


page 1

page 2

page 3

page 4


The intersection of two vertex coloring problems

A hole is an induced cycle with at least four vertices. A hole is even i...

Note on 3-Coloring of (2P_4,C_5)-Free Graphs

We show that the 3-coloring problem is polynomial-time solvable on (2P_4...

Sparsification Lower Bounds for List H-Coloring

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

Coloring Problems on Bipartite Graphs of Small Diameter

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

Connected greedy coloring H-free graphs

A connected ordering (v_1, v_2, ..., v_n) of V(G) is an ordering of the ...

Efficiently list-edge coloring multigraphs asymptotically optimally

We give polynomial time algorithms for the seminal results of Kahn, who ...

Extending Edge-colorings of Complete Hypergraphs into Regular Colorings

Let Xh be the collection of all h-subsets of an n-set X⊇ Y. Given a colo...