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