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\le k<n$, if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-cr…