DP-3-colorability of planar graphs without cycles of length 4, 7 or 9
Abstract
This paper proves that every planar graph without cycles of length 4, 7, or 9 is DP-3-colorable.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.