1 paper
Eun-Kyung Cho, Ilkyoo Choi, Bernard Lidický
The famous Wegner's Planar Graph Conjecture asserts tight upper bounds on the chromatic number of the square G2 of a planar graph G, depending on the maximum degree Δ(G) of…