Qiuli Li

collaborators

2 papers

math.CO2025

On minimal k-factor-critical planar graphs

Qiuli Li, Fuliang Lu, Heping Zhang

A graph of order $n$ is said to be \emph{ $k$ -factor-critical} ( $0 \leq k < n$ ) if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$ -factor-critical gr…

math.CO2024

The minimum degree of minimal $k$ -factor-critical claw-free graphs*

Jing Guo, Qiuli Li, Fuliang Lu +1

A graph $G$ of order $n$ is said to be $k$ -factor-critical for integers $1 \leq k < n$ , if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$ -factor-cr…

On minimal k-factor-critical planar graphs

The minimum degree of minimal k-factor-critical claw-free graphs*

The minimum degree of minimal $k$ -factor-critical claw-free graphs*