The matching extension problem in general graphs is co-NP-complete

Jan Hackfeld, Arie M. C. A. Koster. The matching extension problem in general graphs is co-NP-complete. J. Comb. Optim., 35(3):853-859, 2018. [doi]