{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:46:53Z","timestamp":1770972413503,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T00:00:00Z","timestamp":1581552000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T00:00:00Z","timestamp":1581552000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00373-020-02139-y","type":"journal-article","created":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T19:03:50Z","timestamp":1581620630000},"page":"573-589","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Extendability and Criticality in Matching Theory"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1927-439X","authenticated-orcid":false,"given":"R. E. L.","family":"Aldred","sequence":"first","affiliation":[]},{"given":"Michael D.","family":"Plummer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,13]]},"reference":[{"key":"2139_CR1","first-page":"215","volume":"29","author":"REL Aldred","year":"2004","unstructured":"Aldred, R.E.L., Plummer, M.D.: Edge proximity and matching extension in planar triangulations. Aust. J. Comb. 29, 215\u2013224 (2004)","journal-title":"Aust. J. Comb."},{"key":"2139_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.dam.2016.12.017","volume":"221","author":"REL Aldred","year":"2017","unstructured":"Aldred, R.E.L., Plummer, M.D.: Matching extension in prism graphs. Discrete Appl. Math. 221, 25\u201332 (2017)","journal-title":"Discrete Appl. Math."},{"key":"2139_CR3","unstructured":"Aldred, R.E.L., Plummer, M.D., Ruksasakchai: Distance restricted matching extension missing vertices and edges in 5-connected triangulations of the plane, (submitted)"},{"key":"2139_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/jgt.20276","volume":"57","author":"D Biebighauser","year":"2008","unstructured":"Biebighauser, D., Ellingham, M.: Prism-Hamiltonicity of triangulations. J. Gr. Theory 57, 181\u2013197 (2008)","journal-title":"J. Gr. Theory"},{"key":"2139_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J Bondy","year":"1976","unstructured":"Bondy, J., Murty, U.S.R.: Graph Theory with Applications. American Elsevier, New York (1976)"},{"key":"2139_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0012-365X(92)90593-5","volume":"101","author":"E Gy\u00f6ri","year":"1992","unstructured":"Gy\u00f6ri, E., Plummer, M.: The Cartesian product of a $$k$$-extendable and an $$\\ell $$-extendable graph is $$(k+\\ell +1)$$-extendable. Discrete Math. 101, 87\u201396 (1992)","journal-title":"Discrete Math."},{"key":"2139_CR7","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s10878-017-0226-x","volume":"35","author":"J Hackfeld","year":"2018","unstructured":"Hackfeld, J., Koster, A.M.C.A.: The matching extension problem in general graphs is co-NP-complete. J. Comb. Optim. 35, 853\u2013859 (2018)","journal-title":"J. Comb. Optim."},{"key":"2139_CR8","volume-title":"Handbook of product graphs","author":"R Hammack","year":"2001","unstructured":"Hammack, R., Imrich, W., Klav\u017ear, S.: Handbook of product graphs. CRC, Boca Raton (2001)"},{"key":"2139_CR9","volume-title":"Product Graphs","author":"W Imrich","year":"2000","unstructured":"Imrich, W., Klav\u017ear, S.: Product Graphs. Wiley-Interscience, New York (2000)"},{"key":"2139_CR10","doi-asserted-by":"publisher","DOI":"10.1201\/b10613","volume-title":"Topics in Graph Theory, Graphs and Their Cartesian Products","author":"W Imrich","year":"2008","unstructured":"Imrich, W., Klav\u017ear, S., Rall, D.: Topics in Graph Theory, Graphs and Their Cartesian Products. A.K. Peters, Ltd., Wellesley (2008)"},{"key":"2139_CR11","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1002\/jgt.20250","volume":"56","author":"T Kaiser","year":"2007","unstructured":"Kaiser, T., Ryj\u00e1\u010dek, Z., Kr\u00e1l, D., Rosenfeld, M., Voss, H.-J.: Hamilton cycles in prisms. J. Gr. Theory 56, 249\u2013269 (2007)","journal-title":"J. Gr. Theory"},{"key":"2139_CR12","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0020-0190(97)00177-4","volume":"65","author":"J Lakhal","year":"1998","unstructured":"Lakhal, J., Litzler, L.: A polynomial algorithm for the extendability problem in bipartite graphs. Inform. Process. Lett. 65, 11\u201316 (1998)","journal-title":"Inform. Process. Lett."},{"key":"2139_CR13","volume-title":"Graph Factors and Matching Extensions","author":"G Liu","year":"2009","unstructured":"Liu, G., Yu, Q.R.: Graph Factors and Matching Extensions. Higher Education Press, Beijing (2009)"},{"key":"2139_CR14","doi-asserted-by":"crossref","unstructured":"Liu, G., Yu, Q.R.: Matching extension and products of graphs, Quo vadis, graph theory?, Ann. Discrete Math. 55 North-Holland, Amsterdam, pp. 191\u2013200 (1993)","DOI":"10.1016\/S0167-5060(08)70389-3"},{"key":"2139_CR15","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory, North-Holland Math. Studies 121 Ann. Discrete Math. 29 , North-Holland Publ. Co., Amsterdam (1986). (Reprinted: AMS Chelsea Publishing, Providence, RI, 2009)"},{"key":"2139_CR16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0012-365X(80)90037-0","volume":"31","author":"MD Plummer","year":"1980","unstructured":"Plummer, M.D.: On $$n$$-extendable graphs. Discrete Math. 31, 201\u2013210 (1980)","journal-title":"Discrete Math."},{"key":"2139_CR17","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0167-5060(08)70473-4","volume":"41","author":"MD Plummer","year":"1989","unstructured":"Plummer, M.D.: A theorem on matchings in the plane. Ann. Discrete Math. 41, 347\u2013354 (1989)","journal-title":"Ann. Discrete Math."},{"key":"2139_CR18","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0012-365X(92)00485-A","volume":"127","author":"MD Plummer","year":"1994","unstructured":"Plummer, M.D.: Extending matchings in graphs: a survey. Discrete Math. 127, 277\u2013292 (1994)","journal-title":"Discrete Math."},{"key":"2139_CR19","first-page":"3","volume":"116","author":"MD Plummer","year":"1996","unstructured":"Plummer, M.D.: Extending matchings in graphs: an update. Congr. Numer. 116, 3\u201332 (1996)","journal-title":"Congr. Numer."},{"key":"2139_CR20","doi-asserted-by":"crossref","unstructured":"Plummer, M.D.: Recent progress in matching extension. In: Building Bridges Bolyai Soc. Math. Stud. vol 19. Springer, Berlin, pp. 427\u2013454 (2008)","DOI":"10.1007\/978-3-540-85221-6_14"},{"key":"2139_CR21","first-page":"163","volume":"13","author":"M Porteous","year":"1996","unstructured":"Porteous, M., Aldred, R.E.L.: Matching extensions with prescribed and forbidden edges. Aust. J. Comb. 13, 163\u2013174 (1996)","journal-title":"Aust. J. Comb."},{"key":"2139_CR22","first-page":"365","volume":"29","author":"S Zhai","year":"2009","unstructured":"Zhai, S., Guo, X.: Extending matchings in odd graphs. Acta Math. Sci. Ser. A 29, 365\u2013372 (2009)","journal-title":"Acta Math. Sci. Ser. A"},{"key":"2139_CR23","first-page":"81","volume":"121","author":"S Zhai","year":"2015","unstructured":"Zhai, S., Guo, X.: Extending matchings in planar odd graphs. Ars Comb. 121, 81\u201388 (2015)","journal-title":"Ars Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02139-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-020-02139-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02139-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,12]],"date-time":"2021-02-12T00:50:19Z","timestamp":1613091019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-020-02139-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,13]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["2139"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02139-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,13]]},"assertion":[{"value":"3 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}