activity
20152023
most citedCircular coloring of signed graphs

2 citations · 3 across the 11 of their papers we have counts for

collaborators
Showing 2023Show all

1 paper · 1 filter

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.