Let $G$ be an $n$-vertex graph with the maximum degree $Δ$ and the minimum degree $δ$. We give algorithms with complexity $O(1.3158^{n-0.7~Δ(G)})$ and $O(1.32^{n-0.73~Δ(G)})$ that determines if $G$ is 3-colorable, when $δ(G)\geq 8$ and $δ(G)\geq 7$, respectively.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。