Exponentially many Z5-colorings in simple planar graphs
Rikke Langhede, Carsten Thomassen
·
2020-11-24
·
via math.CO updates on arXiv.org
Every planar simple graph with n vertices has at least 2^(n/9) Z5-colorings.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。