{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:14:17Z","timestamp":1648851257835},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T00:00:00Z","timestamp":1207008000000},"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":[[2008,4]]},"DOI":"10.1007\/s00373-008-0772-1","type":"journal-article","created":{"date-parts":[[2008,5,14]],"date-time":"2008-05-14T17:59:19Z","timestamp":1210787959000},"page":"101-105","source":"Crossref","is-referenced-by-count":0,"title":["Relations between the Circumference and e-Circumference of a Matroid"],"prefix":"10.1007","volume":"24","author":[{"given":"Manoel","family":"Lemos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,15]]},"reference":[{"key":"772_CR1","doi-asserted-by":"crossref","unstructured":"Junior, B.M.: Connected matroids with a small circumference. Discrete Math. 259, 147\u2013161 (2002)","DOI":"10.1016\/S0012-365X(02)00377-1"},{"key":"772_CR2","unstructured":"Lemos, M., Oxley, J.: A sharp bound on the size of a connected matroid. Trans. Amer. Math. Soc. 353, 4039\u20134056 (2001)"},{"key":"772_CR3","unstructured":"Oxley, J.G.: Matroid Theory. Oxford University Press, New York (1992)"},{"key":"772_CR4","unstructured":"Seymour, P.D.: Decomposition of regular matroids. J. Combin. Theory Ser. B 28, 305\u2013359 (1980)"},{"key":"772_CR5","unstructured":"Tutte, W.T.: Lectures on matroids. J. Res. Nat. Bureau of Standards Ser. B 69, 1\u201347 (1965)"},{"key":"772_CR6","doi-asserted-by":"crossref","unstructured":"Wu, P.-L.: On large circuits in matroids, Graphs Combin. 17, 365\u2013388 (2001)","DOI":"10.1007\/PL00007250"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0772-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0772-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0772-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:28Z","timestamp":1559055508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0772-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["772"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0772-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4]]}}}