DeepAI AI Chat
Log In Sign Up

Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model

by   Shiri Chechik, et al.

In this paper, we consider distributed coloring for planar graphs with a small number of colors. We present an optimal (up to a constant factor) O(n) time algorithm for 6-coloring planar graphs. Our algorithm is based on a novel technique that in a nutshell detects small structures that can be easily colored given a proper coloring of the rest of the vertices and removes them from the graph until the graph contains a small enough number of edges. We believe this technique might be of independent interest. In addition, we present a lower bound for 4-coloring planar graphs that essentially shows that any algorithm (deterministic or randomized) for 4-coloring planar graphs requires Ω(n) rounds. We therefore completely resolve the problems of 4-coloring and 6-coloring for planar graphs in the LOCAL model.


page 1

page 2

page 3

page 4


2-distance 4-coloring of planar subcubic graphs with girth at least 21

A 2-distance k-coloring of a graph is a proper vertex k-coloring where v...

Distributed coloring in sparse graphs with fewer colors

This paper is concerned with efficiently coloring sparse graphs in the d...

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...

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...

3-Coloring in Time O(1.3217^n)

We propose a new algorithm for 3-coloring that runs in time O(1.3217^n)....

Bounding generalized coloring numbers of planar graphs using coin models

We study Koebe orderings of planar graphs: vertex orderings obtained by ...

Graph Coloring: Comparing Cluster Graphs to Factor Graphs

We present a means of formulating and solving graph coloring problems wi...