{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T13:28:33Z","timestamp":1770902913928,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"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_29","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:36:05Z","timestamp":1770899765000},"page":"392-403","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Matching Extendability in\u00a0Cartesian Product of\u00a0Hypercubes and\u00a0Paths"],"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":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Aldred, R., Holton, D.A., Lou, D.: N-extendability of symmetric graphs. J. Graph Theor. 17(2), 253\u2013261 (1993)","DOI":"10.1002\/jgt.3190170213"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Aldred, R., Kawarabayashi, K., Plummer, M.: On the matching extendability of graphs in surfaces. J. Comb. Theor. Ser. B 98(1), 105\u2013115 (2008)","DOI":"10.1016\/j.jctb.2007.06.001"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Aldred, R., Plummer, M.: Extendability and criticality in matching theory. Graphs Comb. 36(3), 573\u2013589 (2020)","DOI":"10.1007\/s00373-020-02139-y"},{"key":"29_CR4","unstructured":"Bai, B., Wu, Z., Yang, X., Yu, Q.: Lexicographic product of extendable graphs. Bull. Malaysian Math. Sci. Soc. Second Ser. 33(2), 197\u2013204 (2010)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"de\u00a0Carvalho, M.H., Lucchesi, C.L., Murty, U.S.R.: On a conjecture of Lov\u00e1sz concerning bricks: I. the characteristic of a matching covered graph. J. Comb. Theor. Ser. B 85(1), 94\u2013136 (2002)","DOI":"10.1006\/jctb.2001.2091"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Chen, C.: Binding number and toughness for matching extension. Discret. Math. 146(1\u20133), 303\u2013306 (1995)","DOI":"10.1016\/0012-365X(94)00175-5"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449\u2013467 (1965)","DOI":"10.4153\/CJM-1965-045-4"},{"key":"29_CR8","unstructured":"Gallai, T.: Kritische graphen II. Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zet\u00e9nek K\u00f6zlem\u00e9nyei 8, 373\u2013395 (1963)"},{"key":"29_CR9","doi-asserted-by":"crossref","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 Theor. Centennial 6, 417 (1992)","DOI":"10.21236\/ADA248191"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Hackfeld, J., Koster, A.: The matching extension problem in general graphs is co-NP-complete. J. Comb. Optim. 35, 853\u2013859 (2018)","DOI":"10.1007\/s10878-017-0226-x"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Janseana, P., Ananchuen, N.: Extendability of the complementary prism of extendable graphs. Thai J. Math. 13(3), 703\u2013721 (2015)","DOI":"10.7151\/dmgt.1828"},{"key":"29_CR12","unstructured":"Kotzig, A.: On the theory of finite graphs with a linear factor I. Fyzik\u00e1lny \u010casopis Slovenskej Akademie Vied 9(10) (1959)"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Lakhal, J., Litzler, L.: A polynomial algorithm for the extendability problem in bipartite graphs. Inf. Process. Lett. 65(1), 11\u201316 (1998)","DOI":"10.1016\/S0020-0190(97)00177-4"},{"issue":"3","key":"29_CR14","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":"29_CR15","first-page":"123","volume":"9","author":"D Lou","year":"1994","unstructured":"Lou, D.: Some conditions for $$n$$-extendable graphs. Australasian J. Comb. 9, 123\u2013136 (1994)","journal-title":"Australasian J. Comb."},{"issue":"1\u20133","key":"29_CR16","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0012-365X(98)00181-2","volume":"195","author":"D Lou","year":"1999","unstructured":"Lou, D.: A local independence number condition for $$n$$-extendable graphs. Discret. Math. 195(1\u20133), 263\u2013268 (1999)","journal-title":"Discret. Math."},{"key":"29_CR17","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."},{"issue":"1\u20132","key":"29_CR18","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."},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02579346","volume":"3","author":"L Lov\u00e1sz","year":"1983","unstructured":"Lov\u00e1sz, L.: Ear-decompositions of matching-covered graphs. Combinatorica 3, 105\u2013117 (1983)","journal-title":"Combinatorica"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Plummer, M.: Matching theory, vol.\u00a0367. American Mathematical Soc. (2009)","DOI":"10.1090\/chel\/367"},{"issue":"1\u20133","key":"29_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."},{"issue":"2","key":"29_CR22","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":"29_CR23","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. Discrete Math. 41, 347\u2013354 (1988)","journal-title":"Ann. Discrete Math."},{"issue":"1\u20133","key":"29_CR24","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":"29_CR25","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":"29_CR26","doi-asserted-by":"crossref","unstructured":"Plummer, M.: Recent progress in matching extension. Build. Bridges: Between Math. Comput. Sci. 427\u2013454 (2008)","DOI":"10.1007\/978-3-540-85221-6_14"},{"key":"29_CR27","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1017\/9781009701587.008","volume":"38","author":"J Propp","year":"1999","unstructured":"Propp, J.: Enumeration of matchings: problems and progress. New Perspect. Geom. Combinatorics 38, 255\u2013291 (1999)","journal-title":"New Perspect. Geom. Combinatorics"},{"key":"29_CR28","doi-asserted-by":"publisher","unstructured":"Raman, V., Ramanujan, M.S., Saurabh, S.: Paths, Flowers and vertex cover. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 382\u2013393. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23719-5_33","DOI":"10.1007\/978-3-642-23719-5_33"},{"issue":"2","key":"29_CR29","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":"29_CR30","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."},{"issue":"3","key":"29_CR31","first-page":"317","volume":"82","author":"J Vandenbussche","year":"2022","unstructured":"Vandenbussche, J., Westlund, E.: Matching extendability in Cartesian products of cycles. Australas. J. Comb. 82(3), 317 (2022)","journal-title":"Australas. J. Comb."},{"key":"29_CR32","first-page":"128982","volume":"483","author":"J Wu","year":"2024","unstructured":"Wu, J., Wang, J., Kang, L.: Spectral conditions for matching extension. Appl. Math. Comput. 483, 128982 (2024)","journal-title":"Appl. Math. Comput."}],"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_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:36:12Z","timestamp":1770899772000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17156-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032171559","9783032171566"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17156-6_29","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"}}]}}