1 paper
Gabriel Elvin, Hajrudin FejziÄ, Youngsu Kim
We provide a simplified proof of the following special case of Wegner's conjecture: every planar graph of maximum degree at most three admits a distance-2 coloring with at most eig…