2 papers
math.CO2023
DP-3-colorability of planar graphs without cycles of length 4, 7 or 9
Yingli Kang, Ligang Jin, Xuding Zhu
This paper proves that every planar graph without cycles of length 4, 7, or 9 is DP-3-colorable.
math.CO2023
(I,F)-partition of planar graphs without cycles of length 4, 6, or 9
Yingli Kang, Hongkai Lu, Ligang Jin
A graph is -partitionable if its vertex set can be partitioned into two parts such that one part is an independent set, and the other induces a forest. In this paper, we…