Abstract
Wegner conjectured in 1977 that the square of every planar graph with maximum degree at most is -colorable. We prove this conjecture using the discharging method and computational techniques to verify reducible configurations.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.