4 - Graph Coloring

From Algorithm Wiki
Jump to navigation Jump to search

Problem Description

Graph coloring problem is to assign colors to certain elements of a graph subject to certain constraints.

Vertex coloring is the most common graph coloring problem. The problem is, given m colors, find a way of coloring the vertices of a graph such that no two adjacent vertices are colored using same color. The other graph coloring problems like Edge Coloring (No vertex is incident to two edges of same color) and Face Coloring (Geographical Map Coloring) can be transformed into vertex coloring.

Bounds Chart

4 - Graph ColoringBoundsChart.png

Step Chart

4 - Graph ColoringStepChart.png

Improvement Table

Complexity Classes Algorithm Paper Links Lower Bounds Paper Links
Exp/Factorial [ Brute force (1852)]

Lawler; 1976 (1976)

Byskob 2004 (2004)

Fomin; Gaspers & Saurabh (2007) (2007)

Polynomial > 3