{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T15:24:00Z","timestamp":1778685840385,"version":"3.51.4"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,4,1]],"date-time":"2011-04-01T00:00:00Z","timestamp":1301616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s00373-011-1045-y","type":"journal-article","created":{"date-parts":[[2011,3,31]],"date-time":"2011-03-31T17:21:41Z","timestamp":1301592101000},"page":"433-448","source":"Crossref","is-referenced-by-count":3,"title":["Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs"],"prefix":"10.1007","volume":"28","author":[{"given":"Zan-Bo","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dingjun","family":"Lou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuelian","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,4,1]]},"reference":[{"key":"1045_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy J.A., Murty U.S.R.: Graph Theory with Applications. The Macmillan Press, London (1976)"},{"key":"1045_CR2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.7151\/dmgt.1022","volume":"16","author":"O. Favaron","year":"1996","unstructured":"Favaron O.: On k-factor-critical graphs. Discuss. Math. Graph Theory 16, 41\u201351 (1996)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1045_CR3","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1073\/pnas.48.7.1142","volume":"48","author":"F. Harary","year":"1962","unstructured":"Harary F.: The maximum connetivity of a graph. Proc. Natl. Acad. Sci. USA 48, 1142\u20131164 (1962)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"1045_CR4","first-page":"279","volume-title":"COCOA 2009. LNCS, vol. 5573","author":"Y. Li","year":"2009","unstructured":"Li Y., Nie Z.: A note on n-critical bipartite graphs and its application. In: Du, D., Hu, X., Pardalos, P.M. (eds) COCOA 2009. LNCS, vol. 5573, pp. 279\u2013286. Springer, New York (2009)"},{"key":"1045_CR5","first-page":"65","volume":"24","author":"G. Liu","year":"1998","unstructured":"Liu G., Yu Q.: On n-edge-deletable and n-critical graphs. Bull. Inst. Combin. Appl. 24, 65\u201372 (1998)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"1045_CR6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0166-218X(03)00198-7","volume":"136","author":"D. Lou","year":"2004","unstructured":"Lou D., Yu Q.: Connectivity of k-extendable graphs with large k. Discrete Appl. Math. 136, 55\u201361 (2004)","journal-title":"Discrete Appl. Math."},{"key":"1045_CR7","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0012-365X(95)00042-U","volume":"154","author":"P. Maschlanka","year":"1996","unstructured":"Maschlanka P., Volkmann L.: Independence number in n-extendable graphs. Discrete Math. 154, 167\u2013178 (1996)","journal-title":"Discrete Math."},{"key":"1045_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0012-365X(80)90037-0","volume":"31","author":"M.D. Plummer","year":"1980","unstructured":"Plummer M.D.: On n-extendable graphs. Discrete Math. 31, 201\u2013210 (1980)","journal-title":"Discrete Math."},{"key":"1045_CR9","first-page":"245","volume":"54","author":"M.D. Plummer","year":"1986","unstructured":"Plummer M.D.: Matching extension in bipartite graphs. Congress. Numer. 54, 245\u2013258 (1986)","journal-title":"Congress. Numer."},{"key":"1045_CR10","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0012-365X(92)00485-A","volume":"127","author":"M.D. Plummer","year":"1994","unstructured":"Plummer M.D.: Extending matchings in graphs: a survey. Discrete Math. 127, 277\u2013292 (1994)","journal-title":"Discrete Math."},{"key":"1045_CR11","first-page":"3","volume":"116","author":"M.D. Plummer","year":"1996","unstructured":"Plummer M.D.: Extending matchings in graphs: an update. Congress. Numer. 116, 3\u201332 (1996)","journal-title":"Congress. Numer."},{"key":"1045_CR12","doi-asserted-by":"crossref","unstructured":"Plummer, M.D.: Recent progress in matching extension. In: Gr\u00f6tschel, M., Katona, G.O.H. (eds.) Building Bridges: Between Mathematics and Computer Science. Bolyai Society Mathematical Studies, vol. 19, pp. 427\u2013454 (2008)","DOI":"10.1007\/978-3-540-85221-6_14"},{"key":"1045_CR13","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":"1045_CR14","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. Higher Education Press, Beijing (2009)"},{"key":"1045_CR15","first-page":"279","volume":"85","author":"Z.-B. Zhang","year":"2007","unstructured":"Zhang Z.-B., Wang T., Lou D.: Equivalence between extendibility and factor-criticality. Ars Combin. 85, 279\u2013285 (2007)","journal-title":"Ars Combin."},{"key":"1045_CR16","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1023\/A:1015131912706","volume":"30","author":"H. Zhang","year":"2001","unstructured":"Zhang H., Zhang F.: New lower bound on the number of perfect matchings in fullerene graphs. J. Math. Chem. 30, 343\u2013347 (2001)","journal-title":"J. Math. Chem."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1045-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1045-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1045-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T15:35:28Z","timestamp":1560094528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1045-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,1]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["1045"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1045-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,1]]}}}