The square of a planar cubic graph is -colorable
arXiv:1708.04406
Abstract
We prove the conjecture made by G.Wegner in 1977 that the square of every planar, cubic graph is -colorable. Here, cannot be replaced by .
arXiv:1708.04406
We prove the conjecture made by G.Wegner in 1977 that the square of every planar, cubic graph is -colorable. Here, cannot be replaced by .