A bound on the chromatic number of the square of a planar graph
| Author(s) : | Mohammad R. Salavatipour Michael Molloy, |
| Publisher : | N/A |
| Publication Date : | 2001 |
| ISSN : | N/A |
| Abstract : | Wegner conjectured that the chromatic number of the square of any planar graph G with maximum degree \Delta 8 is bounded by (G 2) d 3, |
