8 citations · 15 across the 7 of their papers we have counts for
1 paper · 1 filter
Carsten Thomassen
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.