A bound on the chromatic number of the square of a planar graph
Under an Elsevier user license
open archive
Keywords
Chromatic number
Square of a graph
Planar graphs
Distance-2-coloring
Frequency channel assignment
Wegner's conjecture
Cited by (0)
- 1
Supported by NSERC, a Sloan Research Fellowship, and a Premier's Research Excellence Award.
- 2
Research done while the author was a graduate student in the Department of Computer Science at University of Toronto. Supported by Research Assistantship, Department of computer science, and University open fellowship, University of Toronto.
Copyright © 2005 Elsevier Inc. All rights reserved.