Log In Sign Up

Faster 3-coloring of small-diameter graphs

by   Michał Dębski, et al.

We study the 3-Coloring problem in graphs with small diameter. In 2013, Mertzios and Spirakis showed that for n-vertex diameter-2 graphs this problem can be solved in subexponential time 2^𝒪(√(n log n)). Whether the problem can be solved in polynomial time remains a well-known open question in the area of algorithmic graphs theory. In this paper we present an algorithm that solves 3-Coloring in n-vertex diameter-2 graphs in time 2^𝒪(n^1/3log^2 n). This is the first improvement upon the algorithm of Mertzios and Spirakis in the general case, i.e., without putting any further restrictions on the instance graph. In addition to standard branchings and reducing the problem to an instance of 2-Sat, the crucial building block of our algorithm is a combinatorial observation about 3-colorable diameter-2 graphs, which is proven using a probabilistic argument. As a side result, we show that 3-Coloring can be solved in time 2^𝒪( (n log n)^2/3) in n-vertex diameter-3 graphs. We also generalize our algorithms to the problem of finding a list homomorphism from a small-diameter graph to a cycle.


page 1

page 2

page 3

page 4


Efficient Deterministic Distributed Coloring with Small Bandwidth

We show that the (degree+1)-list coloring problem can be solved determin...

Colouring Graphs of Bounded Diameter in the Absence of Small Cycles

For k≥ 1, a k-colouring c of G is a mapping from V(G) to {1,2,…,k} such ...

Notes on complexity of packing coloring

A packing k-coloring for some integer k of a graph G=(V,E) is a mapping ...

Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta

The problem of coloring the edges of an n-node graph of maximum degree Δ...

New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the √(n) Barrier

For an n-vertex digraph G=(V,E), a shortcut set is a (small) subset of e...

Coloring Problems on Bipartite Graphs of Small Diameter

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

Fine-grained complexity of the list homomorphism problem: feedback vertex set and cutwidth

For graphs G,H, a homomorphism from G to H is an edge-preserving mapping...