Linear algorithm for 3-coloring of locally connected graphs

Abstract

The problem to decide whether a graph is 3-colorable is NP-complete. We show that if G is a locally connected graph (neighborhood of each vertex induces a connected graph), then there exists a linear algorithm which either finds a 3-coloring of G, or indicates that such coloring does not exist. © Springer-Verlag Berlin Heidelberg 2003.