Distributed coloring in sparse graphs with fewer colors

by   Pierre Aboulker, et al.
Grenoble Institute of Technology
Université de Bordeaux

This paper is concerned with efficiently coloring sparse graphs in the distributed setting with as few colors as possible. According to the celebrated Four Color Theorem, planar graphs can be colored with at most 4 colors, and the proof gives a (sequential) quadratic algorithm finding such a coloring. A natural problem is to improve this complexity in the distributed setting. Using the fact that planar graphs contain linearly many vertices of degree at most 6, Goldberg, Plotkin, and Shannon obtained a deterministic distributed algorithm coloring n-vertex planar graphs with 7 colors in O( n) rounds. Here, we show how to color planar graphs with 6 colors in polylog(n) rounds. Our algorithm indeed works more generally in the list-coloring setting and for sparse graphs (for such graphs we improve by at least one the number of colors resulting from an efficient algorithm of Barenboim and Elkin, at the expense of a slightly worst complexity). Our bounds on the number of colors turn out to be quite sharp in general. Among other results, we show that no distributed algorithm can color every n-vertex planar graph with 4 colors in o(n) rounds.


page 1

page 2

page 3

page 4


Dynamic list coloring of 1-planar graphs

A graph is k-planar if it can be drawn in the plane so that each edge is...

Every planar graph with Δ≥ 8 is totally (Δ+2)-choosable

Total coloring is a variant of edge coloring where both vertices and edg...

Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces

In 1994, Thomassen proved that every planar graph is 5-list-colorable. I...

Distributed Graph Coloring: An Approach Based on the Calling Behavior of Japanese Tree Frogs

Graph coloring, also known as vertex coloring, considers the problem of ...

Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model

In this paper, we consider distributed coloring for planar graphs with a...

Distributed coloring of graphs with an optimal number of colors

This paper studies sufficient conditions to obtain efficient distributed...

Distributed Recoloring

Given two colorings of a graph, we consider the following problem: can w...

Please sign up or login with your details

Forgot password? Click here to reset