Journal of East China Normal University(Natural Sc ›› 2007, Vol. 2007 ›› Issue (5): 85-88.

• Article • Previous Articles     Next Articles

On the 3-Colorable Planar Graph(Chinese)

ZHANG Xue-yuan, CHEN Cang, MIAO Lian-ying   

  1. College of Science, China University of Mining andTechnology, Xuzhou Jiangsu 221008, China
  • Received:2006-07-29 Revised:2007-01-25 Online:2007-09-25 Published:2007-09-25
  • Contact: ZHANG Xue-yuan

Abstract: By using the discharging method, it was proved that every
planar graph is 3-colorable, provided that it has not any 4-,
5-cycles, and the distance between any two triangles is at least 2.

Key words: 3-coloring, discharging method, planar graph, 3-coloring, discharging method

CLC Number: