{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:47:26Z","timestamp":1770972446376,"version":"3.50.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T00:00:00Z","timestamp":1513814400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10878-017-0226-x","type":"journal-article","created":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T03:20:42Z","timestamp":1513826442000},"page":"853-859","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The matching extension problem in general graphs is co-NP-complete"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6030-2268","authenticated-orcid":false,"given":"Jan","family":"Hackfeld","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arie M. C. A.","family":"Koster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"key":"226_CR1","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds J (1965) Paths, trees, and flowers. Can J Math 17:449\u2013467","journal-title":"Can J Math"},{"key":"226_CR2","volume-title":"Integer programming formulations for matching extensions","author":"J Hackfeld","year":"2013","unstructured":"Hackfeld J (2013) Integer programming formulations for matching extensions. Masterarbeit, RWTH Aachen"},{"key":"226_CR3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum, New York, pp 85\u2013103"},{"issue":"1","key":"226_CR4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0020-0190(97)00177-4","volume":"65","author":"J Lakhal","year":"1998","unstructured":"Lakhal J, Litzler L (1998) A polynomial algorithm for the extendability problem in bipartite graphs. Inf Process Lett 65(1):11\u201316","journal-title":"Inf Process Lett"},{"key":"226_CR5","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0012-365X(92)00485-A","volume":"127","author":"MD Plummer","year":"1994","unstructured":"Plummer MD (1994) Extending matchings in graphs: a survey. Disc Math 127:277\u2013292","journal-title":"Disc Math"},{"key":"226_CR6","first-page":"427","volume-title":"Building bridges, bolyai society mathematical studies","author":"MD Plummer","year":"2008","unstructured":"Plummer MD (2008) Recent progress in matching extension. In: Gr\u00f6tschel M, Katona GO, S\u00e1gi G (eds) Building bridges, bolyai society mathematical studies, vol 19. Springer, Berlin Heidelberg, pp 427\u2013454"},{"key":"226_CR7","doi-asserted-by":"crossref","unstructured":"Yu QR, Liu G: k-Extendable graphs and n-factor-critical graphs. In: Graph factors and matching extensions. Springer, Berlin Heidelberg, pp. 209\u2013249 (2009)","DOI":"10.1007\/978-3-540-93952-8_6"},{"issue":"13","key":"226_CR8","doi-asserted-by":"crossref","first-page":"1415","DOI":"10.1016\/j.disc.2005.12.025","volume":"306","author":"F Zhang","year":"2006","unstructured":"Zhang F, Zhang H (2006) Construction for bicritical graphs and k-extendable bipartite graphs. Disc Math 306(13):1415\u20131423","journal-title":"Disc Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0226-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0226-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0226-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T06:52:11Z","timestamp":1570517531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0226-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,21]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["226"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0226-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,21]]}}}