{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:43:56Z","timestamp":1759063436463},"reference-count":9,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":5147,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1992,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A graph <jats:italic>G<\/jats:italic> having a perfect matching is called n\u2010<jats:italic>extendable<\/jats:italic> if every matching of size <jats:italic>n<\/jats:italic> of <jats:italic>G<\/jats:italic> can be extended to a perfect matching. In this note, we show that if <jats:italic>G<\/jats:italic> is an <jats:italic>n<\/jats:italic>\u2010extendable nonbipartite graph, then <jats:italic>G<\/jats:italic> + <jats:italic>e<\/jats:italic> is (<jats:italic>n<\/jats:italic> \u2010 1)\u2010extendable for any edge e \u03f5 E(G). \u00a9 1992 John Wiley &amp; Sons, Inc.<\/jats:p>","DOI":"10.1002\/jgt.3190160408","type":"journal-article","created":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T06:53:35Z","timestamp":1181285615000},"page":"349-353","source":"Crossref","is-referenced-by-count":5,"title":["A note on <i>n<\/i>\u2010extendable graphs"],"prefix":"10.1002","volume":"16","author":[{"given":"Qinglin","family":"Yu","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Graphs & digraphs","author":"Chartrand G.","year":"1986"},{"key":"e_1_2_1_3_2","article-title":"The Cartesian product of a k\u2010extendable and an m\u2010extendable graph is (k + m + 1)\u2010extendable","author":"Gy\u00f6ri E.","journal-title":"Discrete Math."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90085-0"},{"key":"e_1_2_1_5_2","volume-title":"Matching Theory","author":"Lov\u00e1sz L.","year":"1986"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(80)90037-0"},{"key":"e_1_2_1_7_2","first-page":"147","article-title":"Matching extension and connectivity in graphs","volume":"63","author":"Plummer M. D.","year":"1988","journal-title":"Congress. Numer."},{"key":"e_1_2_1_8_2","first-page":"109","article-title":"Research problem 114","volume":"79","author":"Saito A.","year":"1989","journal-title":"Discrete Math."},{"key":"e_1_2_1_9_2","unstructured":"A.Saito Personal communication."},{"key":"e_1_2_1_10_2","article-title":"Characterizations of various matching extensions in graphs","author":"Yu Q. L.","journal-title":"Austr. J. of Combin."}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190160408","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190160408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T19:07:59Z","timestamp":1698088079000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190160408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["10.1002\/jgt.3190160408"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190160408","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}