DP-3-colorability of planar graphs without cycles of length 4, 7 or 9
arXiv:2303.04657
Abstract
This paper proves that every planar graph without cycles of length 4, 7, or 9 is DP-3-colorable.
12 pages, 2 figures
arXiv:2303.04657
This paper proves that every planar graph without cycles of length 4, 7, or 9 is DP-3-colorable.
12 pages, 2 figures