Linear algorithm for 3-coloring of locally connected graphs

  • Authors:

  • Martin Kochol

  • Affiliations:

  • MÚ SAV, Bratislava 1, Slovakia

  • Venue:
  • WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problemt o 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 algorithmw hich either finds a 3-coloring of G, or indicates that such coloring does not exist.