Computing Square Colorings on Bounded-Treewidth and Planar Graphs

11/08/2022
by   Akanksha Agrawal, et al.
0

A square coloring of a graph G is a coloring of the square G^2 of G, that is, a coloring of the vertices of G such that any two vertices that are at distance at most 2 in G receive different colors. We investigate the complexity of finding a square coloring with a given number of q colors. We show that the problem is polynomial-time solvable on graphs of bounded treewidth by presenting an algorithm with running time n^2^tw + 4+O(1) for graphs of treewidth at most tw. The somewhat unusual exponent 2^tw in the running time is essentially optimal: we show that for any ϵ>0, there is no algorithm with running time f(tw)n^(2-ϵ)^tw unless the Exponential-Time Hypothesis (ETH) fails. We also show that the square coloring problem is NP-hard on planar graphs for any fixed number q ≥ 4 of colors. Our main algorithmic result is showing that the problem (when the number of colors q is part of the input) can be solved in subexponential time 2^O(n^2/3log n) on planar graphs. The result follows from the combination of two algorithms. If the number q of colors is small (≤ n^1/3), then we can exploit a treewidth bound on the square of the graph to solve the problem in time 2^O(√(qn)log n). If the number of colors is large (≥ n^1/3), then an algorithm based on protrusion decompositions and building on our result for the bounded-treewidth case solves the problem in time 2^O(nlog n/q).

READ FULL TEXT

page 6

page 10

research
09/02/2020

Exact square coloring of subcubic planar graphs *

We study the exact square chromatic number of subcubic planar graphs. An...
research
09/11/2021

Exact defective colorings of graphs

An exact (k,d)-coloring of a graph G is a coloring of its vertices with ...
research
04/16/2021

Complexity and algorithms for injective edge-coloring in graphs

An injective k-edge-coloring of a graph G is an assignment of colors, i....
research
04/07/2018

Tight Lower Bounds for List Edge Coloring

The fastest algorithms for edge coloring run in time 2^m n^O(1), where m...
research
04/21/2018

Finer Tight Bounds for Coloring on Clique-Width

We revisit the complexity of the classical k-Coloring problem parameteri...
research
08/14/2019

Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs

Given a planar graph G and an integer b, OrthogonalPlanarity is the prob...
research
04/14/2022

A Fixed-Parameter Algorithm for the Kneser Problem

The Kneser graph K(n,k) is defined for integers n and k with n ≥ 2k as t...

Please sign up or login with your details

Forgot password? Click here to reset