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$.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。