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

Jan Hackfeld, Arie M.C.A. Koster

Journal of Combinatorial Optimization 35 (2018), no. 3, 853--859.

BibTex references

@Article\{HK18,

author = "Hackfeld, Jan and Koster, Arie M.C.A.",

title = "The matching extension problem in general graphs is co-NP-complete",

journal = "Journal of Combinatorial Optimization",

number = "3",

volume = "35",

pages = "853--859",

year = "2018",

note = "http://dx.doi.org/10.1007/s10878-017-0226-x",

}