Spectral condition for $k$-factor-criticality in $t$-connected graphs

Tingyan Ma, Edwin R. van Dam, Ligong Wang

A graph $G$ is called $k$-factor-critical if $G-S$ has a perfect matching for every $S\subseteq G$ with $|S|=k$. A connected graph $G$ is called $t$-connected if it has more than $…