{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T13:29:03Z","timestamp":1770902943975,"version":"3.50.1"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032171559","type":"print"},{"value":"9783032171566","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-17156-6_30","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:36:37Z","timestamp":1770899797000},"page":"404-415","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extending Unlocked Matchings in\u00a0Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2169-530X","authenticated-orcid":false,"given":"A. A.","family":"Pereira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4237-4281","authenticated-orcid":false,"given":"C. N.","family":"Campos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"issue":"2","key":"30_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/jgt.3190170213","volume":"17","author":"R Aldred","year":"1993","unstructured":"Aldred, R., Holton, D.A., Lou, D.: N-extendability of symmetric graphs. J. Graph Theory 17(2), 253\u2013261 (1993)","journal-title":"J. Graph Theory"},{"issue":"3","key":"30_CR2","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s00373-020-02139-y","volume":"36","author":"R Aldred","year":"2020","unstructured":"Aldred, R., Plummer, M.: Extendability and criticality in matching theory. Graphs Combin. 36(3), 573\u2013589 (2020)","journal-title":"Graphs Combin."},{"key":"30_CR3","first-page":"153","volume":"9","author":"N Anunchuen","year":"1994","unstructured":"Anunchuen, N., Caccetta, L.: On minimally $$k$$-extendable graphs. Aust. J. Combin. 9, 153\u2013168 (1994)","journal-title":"Aust. J. Combin."},{"key":"30_CR4","first-page":"115","volume":"16","author":"N Anunchuen","year":"1994","unstructured":"Anunchuen, N., Caccetta, L.: On $$(n-2)$$-extendable graphs. J. Combin. Math. Combin. Comput. 16, 115\u2013128 (1994)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"30_CR5","unstructured":"Bai, B., Wu, Z., Yang, X., Yu, Q.: Lexicographic product of extendable graphs. Bull. Malay. Math. Sci. Soc. Second Ser. 33(2), 197\u2013204 (2010)"},{"issue":"1\u20133","key":"30_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0012-365X(94)00175-5","volume":"146","author":"C Chen","year":"1995","unstructured":"Chen, C.: Binding number and toughness for matching extension. Discret. Math. 146(1\u20133), 303\u2013306 (1995)","journal-title":"Discret. Math."},{"issue":"1","key":"30_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"3","author":"GA Dirac","year":"1952","unstructured":"Dirac, G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 3(1), 69\u201381 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449\u2013467 (1965)","journal-title":"Can. J. Math."},{"issue":"1","key":"30_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"30_CR10","unstructured":"Gallai, T.: Kritische graphen II. Magyar Tud. Akad. Mat. Kutato Int. Kozl. 8, 373\u2013395 (1963)"},{"key":"30_CR11","first-page":"417","volume":"6","author":"E Gy\u00f6ri","year":"1992","unstructured":"Gy\u00f6ri, E., Plummer, M.: The Cartesian product of a $$k$$-extendable and an $$l$$-extendable graph is $$(k+ l+ 1)$$-extendable. Julius Petersen Graph Theory Centennial 6, 417 (1992)","journal-title":"Julius Petersen Graph Theory Centennial"},{"key":"30_CR12","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.: The matching extension problem in general graphs is co-NP-complete. J. Comb. Optim. 35, 853\u2013859 (2018)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"30_CR13","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/0095-8956(81)90102-7","volume":"30","author":"R H\u00e4ggkvist","year":"1981","unstructured":"H\u00e4ggkvist, R., Nicoghossian, G.: A remark on hamiltonian cycles. J. Combin. Theory Ser. B 30(1), 118\u2013120 (1981)","journal-title":"J. Combin. Theory Ser. B"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Hall, P.: On representatives of subsets. In: Classic Papers in Combinatorics, pp. 58\u201362 (1987)","DOI":"10.1007\/978-0-8176-4842-8_4"},{"issue":"4","key":"30_CR15","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1002\/jgt.22411","volume":"90","author":"J He","year":"2019","unstructured":"He, J., Wei, E., Ye, D., Zhai, S.: On perfect matchings in matching covered graphs. J. Graph Theory 90(4), 535\u2013546 (2019)","journal-title":"J. Graph Theory"},{"issue":"1","key":"30_CR16","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. Inf. Process. Lett. 65(1), 11\u201316 (1998)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"30_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.21136\/MB.1997.126151","volume":"122","author":"NB Limaye","year":"1997","unstructured":"Limaye, N.B., Sarvate, D.G.: On $$r$$-extendability of the hypercube $$Q_n$$. Math. Bohem. 122(3), 249\u2013255 (1997)","journal-title":"Math. Bohem."},{"key":"30_CR18","first-page":"201","volume":"21","author":"D Lou","year":"2000","unstructured":"Lou, D.: On matchability of graphs. Aust. J. Combin. 21, 201\u2013210 (2000)","journal-title":"Aust. J. Combin."},{"issue":"1\u20132","key":"30_CR19","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. Hungar. 23(1\u20132), 179\u2013195 (1972)","journal-title":"Acta Math. Hungar."},{"issue":"8","key":"30_CR20","doi-asserted-by":"publisher","first-page":"111945","DOI":"10.1016\/j.disc.2020.111945","volume":"343","author":"F Lu","year":"2020","unstructured":"Lu, F., Kothari, N., Feng, X., Zhang, L.: Equivalence classes in matching covered graphs. Discret. Math. 343(8), 111945 (2020)","journal-title":"Discret. Math."},{"issue":"1\u20133","key":"30_CR21","doi-asserted-by":"publisher","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. Discret. Math. 154(1\u20133), 167\u2013178 (1996)","journal-title":"Discret. Math."},{"key":"30_CR22","unstructured":"Pereira, A.A., Campos, C.N.: Matching extendability in cartesian product of hypercubes and paths. Manuscript (2025)"},{"issue":"2","key":"30_CR23","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0012-365X(80)90037-0","volume":"31","author":"M Plummer","year":"1980","unstructured":"Plummer, M.: On $$n$$-extendable graphs. Discret. Math. 31(2), 201\u2013210 (1980)","journal-title":"Discret. Math."},{"key":"30_CR24","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0167-5060(08)70473-4","volume":"41","author":"M Plummer","year":"1988","unstructured":"Plummer, M.: A theorem on matchings in the plane. Ann. Discret. Math. 41, 347\u2013354 (1988)","journal-title":"Ann. Discret. Math."},{"issue":"1\u20133","key":"30_CR25","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0012-365X(94)90171-6","volume":"125","author":"M Plummer","year":"1994","unstructured":"Plummer, M.: Extending matchings in claw-free graphs. Discret. Math. 125(1\u20133), 301\u2013307 (1994)","journal-title":"Discret. Math."},{"issue":"1\u20133","key":"30_CR26","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. Discret. Math. 127(1\u20133), 277\u2013292 (1994)","journal-title":"Discret. Math."},{"key":"30_CR27","first-page":"3","volume":"116","author":"M Plummer","year":"1996","unstructured":"Plummer, M.: Extending matchings in graphs: an update. Congr. Numer. 116, 3 (1996)","journal-title":"Congr. Numer."},{"key":"30_CR28","doi-asserted-by":"crossref","unstructured":"Plummer, M.: Recent progress in matching extension. In: Building Bridges: Between Mathematics and Computer Science, pp. 427\u2013454 (2008)","DOI":"10.1007\/978-3-540-85221-6_14"},{"key":"30_CR29","unstructured":"P\u00f3sa, L.: A theorem concerning Hamilton lines. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl 7, 225\u2013226 (1962)"},{"key":"30_CR30","doi-asserted-by":"crossref","unstructured":"Roth, A.: Online and Matching-Based Market Design. Cambridge University Press (2023)","DOI":"10.1017\/9781108937535"},{"issue":"1","key":"30_CR31","doi-asserted-by":"publisher","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. Am. Math. Soc. 42(1), 8\u201312 (1974)","journal-title":"Proc. Am. Math. Soc."},{"issue":"2","key":"30_CR32","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"1","author":"W Tutte","year":"1947","unstructured":"Tutte, W.: The factorization of linear graphs. J. Lond. Math. Soc. 1(2), 107\u2013111 (1947)","journal-title":"J. Lond. Math. Soc."},{"issue":"3","key":"30_CR33","doi-asserted-by":"publisher","first-page":"1539","DOI":"10.1137\/080732687","volume":"23","author":"J Vandenbussche","year":"2009","unstructured":"Vandenbussche, J., West, D.B.: Matching extendability in hypercubes. SIAM J. Discret. Math. 23(3), 1539\u20131547 (2009)","journal-title":"SIAM J. Discret. Math."},{"key":"30_CR34","first-page":"257","volume":"17","author":"L Vergnas","year":"1975","unstructured":"Vergnas, L.: A note on matchings in graphs. Cahiers Cent. \u00c9tudes Recherche Op\u00e9r. 17, 257 (1975)","journal-title":"Cahiers Cent. \u00c9tudes Recherche Op\u00e9r."},{"key":"30_CR35","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-0-8176-4789-6_19","volume-title":"Structural Analysis of Complex Networks","author":"D Vuki\u010devi\u0107","year":"2010","unstructured":"Vuki\u010devi\u0107, D.: Applications of perfect matchings in chemistry. In: Dehmer, M. (ed.) Structural Analysis of Complex Networks, pp. 463\u2013482. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-0-8176-4789-6_19"},{"issue":"2","key":"30_CR36","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/TCBB.2004.22","volume":"1","author":"C Witwer","year":"2004","unstructured":"Witwer, C., Hofacker, I., Stadler, P.: Prediction of consensus RNA secondary structures including pseudoknots. IEEE\/ACM Trans. Comput. Biol. Bioinf. 1(2), 66\u201377 (2004)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17156-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:36:43Z","timestamp":1770899803000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17156-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032171559","9783032171566"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17156-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dharwad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam2026.iitdh.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}