In this note, we prove that every non-complete $(k+1)$-critical graph contains cycles of all lengths modulo $k$, where $k=4,5$.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。
