{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T14:36:44Z","timestamp":1772548604899,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3485,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0166-218x(03)00198-7","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T14:49:36Z","timestamp":1063378176000},"page":"55-61","source":"Crossref","is-referenced-by-count":18,"title":["Connectivity of k-extendable graphs with large k"],"prefix":"10.1016","volume":"136","author":[{"given":"Dingjun","family":"Lou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinglin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(03)00198-7_BIB1","first-page":"39","article-title":"On critically k-extendable graphs","volume":"6","author":"Ananchuen","year":"1992","journal-title":"Australas. J. Combin."},{"key":"10.1016\/S0166-218X(03)00198-7_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(95)00352-W","article-title":"Matching extension and minimum degree","volume":"170","author":"Ananchuen","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00198-7_BIB3","series-title":"Handbook of Combinatorics","first-page":"56","article-title":"Basic graph theory: paths and circuits","author":"Bondy","year":"1990"},{"key":"10.1016\/S0166-218X(03)00198-7_BIB4","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0166-218X(03)00198-7_BIB5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","article-title":"Some theorems on abstract graphs","volume":"2","author":"Dirac","year":"1952","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/S0166-218X(03)00198-7_BIB6","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0012-365X(98)00291-X","article-title":"On the structure of minimally n-extendable bipartite graphs","volume":"202","author":"Lou","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00198-7_BIB7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0012-365X(80)90037-0","article-title":"On n-extendable graphs","volume":"31","author":"Plummer","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00198-7_BIB8","first-page":"245","article-title":"Matching extension in bipartite graphs","volume":"54","author":"Plummer","year":"1988","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(03)00198-7_BIB9","first-page":"3","article-title":"Extending matchings in graphs","volume":"116","author":"Plummer","year":"1996","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(03)00198-7_BIB10","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1002\/jgt.3190160408","article-title":"A note on n-extendable graphs","volume":"16","author":"Yu","year":"1992","journal-title":"J. Graph Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03001987?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03001987?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T13:21:43Z","timestamp":1551014503000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03001987"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0166218X03001987"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00198-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}