Minimally k-factor-critical graphs for some large k

Jing Guo, Heping Zhang

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. $1$- and $2$-f…