| Article ID: | iaor20126002 |
| Volume: | 24 |
| Issue: | 4 |
| Start Page Number: | 580 |
| End Page Number: | 592 |
| Publication Date: | Nov 2012 |
| Journal: | Journal of Combinatorial Optimization |
| Authors: | Bu Yuehua, Zhu Xubo |
| Keywords: | graphs |
The square coloring of a graph is to color the vertices of a graph at distance at most 2 with different colors. In 1977, Wegner posed a conjecture on square coloring of planar graphs. The conjecture is still open. In this paper, we prove that Wegner’s conjecture is true for planar graphs with girth at least 6.