A Sufficient Condition for 3-colorable of Planar Graphs
Zhiyang Jia, Xiao Xian Huang, Wei Dong Gao · 2012
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In this paper, we proved that if a planar graph without triangles adjacent to cycles of length 4, 6, 9 and no triangular 7-face adjacent to 7-face or two 5-faces is 3-colorable .