15,599 research outputs found
The square of a planar cubic graph is -colorable
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
- …
15,599 research outputs found