Dynamic Coloring for Planar Graph
Kewen Zhao · Journal of Zhengzhou University · 2010
A dynamic coloring for planar graph is mainly discussed.An induced graph,obtained by defining an algorithm,is used to study the upper bounds of dynamic chromatic number of the planar graph.And,the conclusion is: if G is planar,then χd(G)≤5.