{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T11:12:28Z","timestamp":1683025948801},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1007\/bf01202239","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T13:31:07Z","timestamp":1109338267000},"page":"79-83","source":"Crossref","is-referenced-by-count":0,"title":["A new recursive theorem onn-extendibility"],"prefix":"10.1007","volume":"13","author":[{"given":"Tsuyoshi","family":"Nishimura","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"Chartrand, G., Lesniak, L.: Graphs & Digraphs, 2nd ed., Wadsworth 1986"},{"key":"CR2","unstructured":"Enomoto, H.: Private Communication"},{"key":"CR3","first-page":"3","volume":"38","author":"T. Nishimura","year":"1994","unstructured":"Nishimura, T.: A theorem onn-extendable graphs. Ars Comb.38, 3?5 (1994)","journal-title":"Ars Comb."},{"key":"CR4","first-page":"129","volume":"30","author":"T. Nishimura","year":"1994","unstructured":"Nishimura, T.: Extendable graphs and induced subgraphs. SUT Journal of Mathematics30, 129?135 (1994)","journal-title":"SUT Journal of Mathematics"},{"key":"CR5","unstructured":"Nishimura, T., Saito, A.: Two recursive theorems onn-extendibility. Preprint"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0012-365X(80)90037-0","volume":"31","author":"M.D. Plummer","year":"1980","unstructured":"Plummer, M.D.: Onn-extendable graphs. Discrete Math.31, 201?210 (1980)","journal-title":"Discrete Math."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1090\/S0002-9939-1974-0323648-6","volume":"42","author":"D.P. Summer","year":"1974","unstructured":"Summer, D.P.: Graphs with 1-factors. Proc. Amer. Math. Soc.42, 8?12 (1974)","journal-title":"Proc. Amer. Math. Soc."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202239.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01202239\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202239","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T10:40:11Z","timestamp":1683024011000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01202239"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["BF01202239"],"URL":"https:\/\/doi.org\/10.1007\/bf01202239","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}