{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:31:44Z","timestamp":1742916704391,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020254"},{"type":"electronic","value":"9783642020261"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02026-1_26","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T16:31:23Z","timestamp":1245256283000},"page":"279-286","source":"Crossref","is-referenced-by-count":0,"title":["A Note on n-Critical Bipartite Graphs and Its Application"],"prefix":"10.1007","author":[{"given":"Yueping","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhe","family":"Nie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.7151\/dmgt.1022","volume":"16","author":"O. Favaron","year":"1996","unstructured":"Favaron, O.: On k-Critical Graphs. Discuss. Math. Graph Theory\u00a016, 41\u201351 (1996)","journal-title":"Discuss. Math. Graph Theory"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0012-365X(99)00172-7","volume":"213","author":"O. Favaron","year":"2000","unstructured":"Favaron, O.: Extendability and Factor-Criticality. Discrete Math.\u00a0213, 115\u2013122 (2000)","journal-title":"Discrete Math."},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1137\/S0097539798347189","volume":"30","author":"H. Gabow","year":"2000","unstructured":"Gabow, H., Jordan, T.: How to Make a Square Grid Framework with Cables Rigid. SIAM Journal of Computing\u00a030, 649\u2013680 (2000)","journal-title":"SIAM Journal of Computing"},{"key":"26_CR4","unstructured":"Li, Y., Lou, D.: Matching Extendability Augmentation in Bipartite Graphs. In: International Multiconference of Engineers and Computer Scientists (IMECS 2007), IAENG, Hongkong, pp. 2291\u20132296 (2007)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-72588-6_66","volume-title":"Computational Science \u2013 ICCS 2007","author":"Y. Li","year":"2007","unstructured":"Li, Y., Lou, D.: Finding the (n,k,0)-Extendability in Bipartite Graphs and its Application. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007. LNCS, vol.\u00a04489, pp. 401\u2013409. Springer, Heidelberg (2007)"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0012-365X(00)00328-9","volume":"231","author":"G. Liu","year":"2001","unstructured":"Liu, G., Yu, Q.: Generlization of Matching Extensions in Graphs. Discrete Math.\u00a0231, 311\u2013320 (2001)","journal-title":"Discrete Math."},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0012-365X(92)00485-A","volume":"127","author":"M. Plummer","year":"1994","unstructured":"Plummer, M.: Extending Matchings in Graphs: a Survey. Discrete Math.\u00a0127, 277\u2013292 (1994)","journal-title":"Discrete Math."},{"key":"26_CR8","first-page":"3","volume":"116","author":"M. Plummer","year":"1996","unstructured":"Plummer, M.: Extending Matchings in Graphs: an Update. Congr. Numer.\u00a0116, 3\u201332 (1996)","journal-title":"Congr. Numer."},{"key":"26_CR9","first-page":"245","volume":"54","author":"M. Plummer","year":"1986","unstructured":"Plummer, M.: Matching Extension in Bipartite Graphs. Congr. Numer.\u00a054, 245\u2013258 (1986)","journal-title":"Congr. Numer."},{"key":"26_CR10","first-page":"55","volume":"7","author":"Q. Yu","year":"1993","unstructured":"Yu, Q.: Characterizations of Various Matching Extensions in Graphs. Australas. J. Combin.\u00a07, 55\u201364 (1993)","journal-title":"Australas. J. Combin."},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"1415","DOI":"10.1016\/j.disc.2005.12.025","volume":"306","author":"F. Zhang","year":"2006","unstructured":"Zhang, F., Zhang, H.: Construction for Bicritical Graphs and k-Extendable Bipartite Graphs. Discrete Math.\u00a0306, 1415\u20131423 (2006)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02026-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:55:43Z","timestamp":1714622143000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02026-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020254","9783642020261"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02026-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}