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\le k\le \frac{|V(G)|}{2}-1$, if any matching in $G$ of size $k$ is contained in a…