2 papers
math.CO2025
The square of every subcubic planar graph without 4-cycles and 5-cycles is 7-choosable
Ligang Jin, Yingli Kang, Seog-Jin Kim
The square of a graph , denoted by , has the same vertex set as and has an edge between two vertices if the distance between them in is at most . Thomassen (2018…
math.CO2024
Planar graphs having no cycle of length , or are DP-3-colorable
Ligang Jin, Yingli Kang, Xuding Zhu
The concept of DP-coloring of graphs was introduced by DvoÅák and Postle, and was used to prove that planar graphs without cycles of length from to are -choosable. In…