The Properties of Coloring Some Plane Graphs
Han You-f · Jilin Normal University Journal · 2016
In this paper,it studies the properties of coloring some plane graphs by using the properties of chromatic polynomial of plane graphs. It deals with mainly the properties of coloring some plane graphs after triangulation and generalized division. It studies the smallest number of ways to faces-color the graph with colors so that no two adjacent faces receive the same color,by discussing the zeros of the chromatic polynomial of graphs. And given the important properties of the number of ways to color plane division graphs. It proofs that the smallest number of coloring some plane graphs is not change under triangulation and generalized division.