Self-stabilizing coloration in anonymous planar networks

A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs

“…Huang et al [33] revisited the problem of coloring planar graphs and proposed an algorithm having two layers like the one by Ghosh and Karaata. The first layer orders the nodes and the second layer colors the nodes by following the calculated order.…”