6-coloring Algorithm. ALGORITHM 6 COLOR. More speci cally we obtain a deterministic Ologn time. Algorithm 4 6-Color 1. Assume that initially the nodes have IDs of size logn bits 2. The root assigns itself the label 0 3.
Send own color c v to all children 5. The root assigns itself the label 0 3. Color the rest of the graph with a recursive call to Kempes algorithm. Algorithm 4 6-Color 1. ALGORITHM 6 COLOR.
Send own color c v to all children 5.
The root assigns itself the label 0 3. Kempes graph-coloring algorithm To 6-color a planar graph. Every planar graph has at least one vertex of degree 5. The root assigns itself the label 0 3. Color the rest of the graph with a recursive call to Kempes algorithm. Given an n vertex planar graph G in adjacency list form this algorithm determines a 6-coloring of G. Assume that initially the nodes have IDs of size logn bits 2. ALGORITHM 6 COLOR.
