Yingli Kang

activity

20232025

collaborators

Showing math.COShow all

3 papers · 1 filter

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 $G$ , denoted by $G^{2}$ , has the same vertex set as $G$ and has an edge between two vertices if the distance between them in $G$ is at most $2$ . Thomassen (2018…

math.CO2024

Planar graphs having no cycle of length $4$ , $6$ or $8$ 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 $4$ to $8$ are $3$ -choosable. In th…

math.CO2023

(I,F)-partition of planar graphs without cycles of length 4, 6, or 9

Yingli Kang, Hongkai Lu, Ligang Jin

A graph $G$ is $(I, F)$ -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…

The square of every subcubic planar graph without 4-cycles and 5-cycles is 7-choosable

Planar graphs having no cycle of length 4, 6 or 8 are DP-3-colorable

(I,F)-partition of planar graphs without cycles of length 4, 6, or 9

Planar graphs having no cycle of length $4$ , $6$ or $8$ are DP-3-colorable