DP-3-colorability of planar graphs without cycles of length 4, 7 or 9
Yingli Kang, Ligang Jin, Xuding Zhu
·
2023-03-08
·
via math.CO updates on arXiv.org
This paper proves that every planar graph without cycles of length 4, 7, or 9 is DP-3-colorable.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。