Fuliang Lu

activity

20222026

collaborators

Showing 2025Show all

2 papers · 1 filter

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.CO2025

The minimum degree of minimal 2-extendable claw-free graphs

Jing Guo, Fuliang Lu, Heping Zhang

A connected graph $G$ with a perfect matching is said to be $k$ -extendable for integers $k$ , $1 \leq k \leq \frac{∣ V ( G ) ∣}{2} - 1$ , if any matching in $G$ of size $k$ is contained in a…