The chromatic number of the square of subcubic planar graphs

preprint2016arXivOpen access

Abstract

Wegner conjectured in 1977 that the square of every planar graph with maximum degree at most 33 is 77-colorable. We prove this conjecture using the discharging method and computational techniques to verify reducible configurations.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.