Papers
Topics
Authors
Recent
Search
2000 character limit reached

Computing Square Colorings on Bounded-Treewidth and Planar Graphs

Published 8 Nov 2022 in cs.DS and cs.DM | (2211.04458v1)

Abstract: A square coloring of a graph GG is a coloring of the square G2G^2 of GG, that is, a coloring of the vertices of GG such that any two vertices that are at distance at most $2$ in GG receive different colors. We investigate the complexity of finding a square coloring with a given number of qq colors. We show that the problem is polynomial-time solvable on graphs of bounded treewidth by presenting an algorithm with running time n2tw⁡+4+O(1)n^{2^{\operatorname{tw} + 4}+O(1)} for graphs of treewidth at most tw⁡\operatorname{tw}. The somewhat unusual exponent 2tw⁡2^{\operatorname{tw}} in the running time is essentially optimal: we show that for any ϵ>0\epsilon>0, there is no algorithm with running time f(tw⁡)n(2−ϵ)tw⁡f(\operatorname{tw})n^{(2-\epsilon)^{\operatorname{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≥4q \ge 4 of colors. Our main algorithmic result is showing that the problem (when the number of colors qq is part of the input) can be solved in subexponential time 2O(n2/3log⁡n)2^{O(n^{2/3}\log n)} on planar graphs. The result follows from the combination of two algorithms. If the number qq of colors is small (≤n1/3\le n^{1/3}), then we can exploit a treewidth bound on the square of the graph to solve the problem in time 2O(qnlog⁡n)2^{O(\sqrt{qn}\log n)}. If the number of colors is large (≥n1/3\ge 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 2O(nlog⁡n/q)2^{O(n\log n/q)}.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.