We prove for k at most 10, that every graph of chromatic number k with a unique k-coloring admits a clique minor of order k.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。