{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T04:45:01Z","timestamp":1781412301406,"version":"3.54.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271229"],"award-info":[{"award-number":["12271229"]}],"id":[{"id":"10.13039\/501100001809","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":[[2023,5]]},"DOI":"10.1007\/s00373-023-02656-6","type":"journal-article","created":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T14:53:11Z","timestamp":1684162391000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Minimally k-Factor-Critical Graphs for Some Large k"],"prefix":"10.1007","volume":"39","author":[{"given":"Jing","family":"Guo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5385-6687","authenticated-orcid":false,"given":"Heping","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,5,15]]},"reference":[{"key":"2656_CR1","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.ejc.2013.06.045","volume":"36","author":"H Bruhn","year":"2014","unstructured":"Bruhn, H., Stein, M.: Minimal bricks have many vertices of small degree. Eur. J. Comb. 36, 261\u2013269 (2014)","journal-title":"Eur. J. Comb."},{"key":"2656_CR2","doi-asserted-by":"publisher","first-page":"2386","DOI":"10.1016\/j.disc.2005.12.032","volume":"306","author":"MH de Carvalho","year":"2006","unstructured":"de Carvalho, M.H., Lucchesi, C.L., Murty, U.S.R.: How to build a brick. Discrete Math. 306, 2386\u20132410 (2006)","journal-title":"Discrete Math."},{"key":"2656_CR3","doi-asserted-by":"publisher","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":"2656_CR4","first-page":"89","volume":"17","author":"O Favaron","year":"1998","unstructured":"Favaron, O., Shi, M.: Minimally $$k$$-factor-critical graphs. Australas. J. Comb. 17, 89\u201397 (1998)","journal-title":"Australas. J. Comb."},{"key":"2656_CR5","doi-asserted-by":"publisher","first-page":"271","DOI":"10.7151\/dmgt.1054","volume":"17","author":"O Favaron","year":"1997","unstructured":"Favaron, O., Flandrin, E., Ryj\u00e1\u010dek, Z.: Factor-criticality and matching extension in DCT-graphs. Discuss. Math. Graph Theory 17, 271\u2013278 (1997)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2656_CR6","first-page":"135","volume":"8","author":"T Gallai","year":"1963","unstructured":"Gallai, T.: Neuer Beweis eines Tutte\u2019schen Satzes, Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 8, 135\u2013139 (1963)","journal-title":"Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"2656_CR7","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01889914","volume":"23","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: On the structure of factorizable graphs. Acta Math. Acad. Sci. Hungar. 23, 179\u2013195 (1972)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"2656_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0012-365X(98)00291-X","volume":"202","author":"D Lou","year":"1999","unstructured":"Lou, D.: On the structure of minimally $$n$$-extendable bipartite graphs. Discrete Math. 202, 173\u2013181 (1999)","journal-title":"Discrete Math."},{"key":"2656_CR9","first-page":"201","volume":"21","author":"D Lou","year":"2000","unstructured":"Lou, D.: On matchability of graphs. Australas. J. Comb. 21, 201\u2013210 (2000)","journal-title":"Australas. J. Comb."},{"key":"2656_CR10","first-page":"123","volume":"9","author":"D Lou","year":"1994","unstructured":"Lou, D.: Some conditions for $$n$$-extendable graphs. Australas. J. Comb. 9, 123\u2013136 (1994)","journal-title":"Australas. J. Comb."},{"key":"2656_CR11","unstructured":"Lov\u00e1sz, L., Plummer, M. D.: Matching theory. Ann. Discrete Math. 29 (1986)"},{"key":"2656_CR12","doi-asserted-by":"publisher","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":"2656_CR13","first-page":"127","volume":"29","author":"D Lou","year":"2004","unstructured":"Lou, D., Yu, Q.: Sufficient conditions for $$n$$-matchable graphs. Australas. J. Comb. 29, 127\u2013133 (2004)","journal-title":"Australas. J. Comb."},{"key":"2656_CR14","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1002\/jgt.21747","volume":"76","author":"F Lin","year":"2014","unstructured":"Lin, F., Zhang, L., Lu, F.: The cubic vertices of minimal bricks. J. Graph Theory 76, 20\u201333 (2014)","journal-title":"J. Graph Theory"},{"key":"2656_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0012-365X(02)00303-5","volume":"259","author":"T Nishimura","year":"2002","unstructured":"Nishimura, T.: A closure concept in factor-critical graphs. Discrete Math. 259, 319\u2013324 (2002)","journal-title":"Discrete Math."},{"key":"2656_CR16","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/j.jctb.2005.10.005","volume":"96","author":"S Norine","year":"2006","unstructured":"Norine, S., Thomas, R.: Minimal bricks. J. Comb. Theory Ser. B 96, 505\u2013513 (2006)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2656_CR17","first-page":"489","volume-title":"Contemporary Methods in Graph Theory (B)","author":"MD Plummer","year":"1990","unstructured":"Plummer, M.D.: Degree sums, neighborhood unions and matching extension in graphs. In: Bodendiek, R. (ed.) Contemporary Methods in Graph Theory (B), pp. 489\u2013502. I. Wissenschaftsverlag, Mannheim (1990)"},{"key":"2656_CR18","doi-asserted-by":"publisher","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":"2656_CR19","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"22","author":"WT Tutte","year":"1947","unstructured":"Tutte, W.T.: The factorization of linear graphs. J. Lond. Math. Soc. 22, 107\u2013111 (1947)","journal-title":"J. Lond. Math. Soc."},{"key":"2656_CR20","first-page":"55","volume":"7","author":"Q Yu","year":"1993","unstructured":"Yu, Q.: Characterizations of various matching extensions in graphs. Australas. J. Comb. 7, 55\u201364 (1993)","journal-title":"Australas. J. Comb."},{"key":"2656_CR21","doi-asserted-by":"publisher","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":"2656_CR22","first-page":"279","volume":"85","author":"Z Zhang","year":"2007","unstructured":"Zhang, Z., Wang, T., Lou, D.: Equivalence between extendibility and factor-criticality. Ars Comb. 85, 279\u2013285 (2007)","journal-title":"Ars Comb."},{"key":"2656_CR23","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/s10255-022-1064-x","volume":"38","author":"S Zhai","year":"2022","unstructured":"Zhai, S., Wei, E., Zhang, F.: The characterization of $$p$$-factor-critical graphs. Acta Math. Appl. Sin. (English Ser.) 38, 154\u2013158 (2022)","journal-title":"Acta Math. Appl. Sin. (English Ser.)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02656-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02656-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02656-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,28]],"date-time":"2023-05-28T17:02:53Z","timestamp":1685293373000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02656-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["2656"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02656-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5]]},"assertion":[{"value":"1 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"60"}}