Author:
Wang Yang,Wang Jiali,Wang Weifan,Kong Jiangxu
Reference14 articles.
1. Every planar graph map is four colourable;Appel;Bull. Am. Math. Soc.,1976
2. On acyclic coloring of planar graphs;Borodin;Discrete Math.,1979
3. On the partition of a planar graph of girth 5 into an empty and an acyclic subgraph;Borodin;Diskretn. Anal. Issled. Opear. Ser.,2001
4. Threshold for Path Colorings of Planar Graphs;Chappell,2006
5. Vertex-arboricity of planar graphs without intersecting triangles;Chen;Eur. J. Comb.,2012