{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:37Z","timestamp":1740107137654,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,4,4]],"date-time":"2016-04-04T00:00:00Z","timestamp":1459728000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["11471257"],"award-info":[{"award-number":["11471257"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["144073"],"award-info":[{"award-number":["144073"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s00373-016-1687-x","type":"journal-article","created":{"date-parts":[[2016,4,4]],"date-time":"2016-04-04T14:56:26Z","timestamp":1459781786000},"page":"2009-2018","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generalization of Matching Extensions in Graphs (IV): Closures"],"prefix":"10.1007","volume":"32","author":[{"given":"Hongliang","family":"Lu","sequence":"first","affiliation":[]},{"given":"Qinglin","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,4]]},"reference":[{"key":"1687_CR1","first-page":"258","volume":"247","author":"C Berge","year":"1958","unstructured":"Berge, C.: Sur le couplaage maximum d\u2019un graphe. C. R. Acad. Sci. Paris 247, 258\u2013259 (1958)","journal-title":"C. R. Acad. Sci. Paris"},{"key":"1687_CR2","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B., Riordan, O., Ryj\u00e1c\u0306ek, Z., Saito, A., Schelp, R.H.: Closure and hamiltonian-connectivity of claw-free graphs. Discrete Math. 195, 67\u201380 (1999)","DOI":"10.1016\/S0012-365X(98)00165-4"},{"key":"1687_CR3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(76)90078-9","volume":"15","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Chv\u00e1tal, V.: A method in graph theory. Discrete Math. 15, 111\u2013136 (1976)","journal-title":"Discrete Math."},{"key":"1687_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.7151\/dmgt.1022","volume":"16","author":"O Favaron","year":"1996","unstructured":"Favaron, O.: On $$k$$ k -factor-critical graphs. Discuss. Math. Graph Theory 16, 41\u201351 (1996)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1687_CR5","doi-asserted-by":"crossref","first-page":"1267","DOI":"10.1016\/j.dam.2006.10.015","volume":"155","author":"Z Jin","year":"2007","unstructured":"Jin, Z., Yan, H., Yu, Q.: Generalization of matching extensions in graphs (II). Discrete Appl. Math. 155, 1267\u20131274 (2007)","journal-title":"Discrete Appl. Math."},{"key":"1687_CR6","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0012-365X(00)00328-9","volume":"231","author":"G Liu","year":"2001","unstructured":"Liu, G., Yu, Q.: Generalization of matching extensions in graphs. Discrete Math. 231, 311\u2013320 (2001)","journal-title":"Discrete Math."},{"key":"1687_CR7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0012-365X(80)90037-0","volume":"31","author":"MD Plummer","year":"1980","unstructured":"Plummer, M.D.: On $$n$$ n -extendable graphs. Discrete Math. 31, 201\u2013210 (1980)","journal-title":"Discrete Math."},{"key":"1687_CR8","doi-asserted-by":"crossref","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":"1687_CR9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0012-365X(99)00234-4","volume":"215","author":"MD Plummer","year":"2000","unstructured":"Plummer, M.D., Saito, A.: Closure and factor-critical graphs. Discrete Math. 215, 171\u2013179 (2000)","journal-title":"Discrete Math."},{"key":"1687_CR10","doi-asserted-by":"crossref","unstructured":"Ryj\u00e1c\u0306ek, Z.: On a closure concept in claw-free graphs. J. Combin. Theory Ser. B 70, 217\u2013224 (1997)","DOI":"10.1006\/jctb.1996.1732"},{"key":"1687_CR11","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1090\/S0002-9939-1974-0323648-6","volume":"42","author":"DP Sumner","year":"1974","unstructured":"Sumner, D.P.: Graphs with 1-factors. Proc. Amer. Math. Soc. 42, 8\u201312 (1974)","journal-title":"Proc. Amer. Math. Soc."},{"key":"1687_CR12","first-page":"55","volume":"7","author":"Q Yu","year":"1993","unstructured":"Yu, Q.: Characterizations of various matching extensions in graphs. Australas. J. Combin. 7, 55\u201364 (1993)","journal-title":"Australas. J. Combin."},{"key":"1687_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-93952-8","volume-title":"Graph Factors and Matching Extensions","author":"Q Yu","year":"2009","unstructured":"Yu, Q., Liu, G.: Graph Factors and Matching Extensions. Springer-Verlag, Berlin (2009)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1687-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-016-1687-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1687-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T01:23:20Z","timestamp":1655429000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-016-1687-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,4]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["1687"],"URL":"https:\/\/doi.org\/10.1007\/s00373-016-1687-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2016,4,4]]}}}