Article ID Journal Published Year Pages File Type
8903908 Journal of Combinatorial Theory, Series B 2018 27 Pages PDF
Abstract
We prove the conjecture made by G. Wegner in 1977 that the square of every planar, cubic graph is 7-colorable. Here, 7 cannot be replaced by 6.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
The square of a planar cubic graph is 7-colorable
Authors
,