{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T05:24:10Z","timestamp":1772515450668,"version":"3.50.1"},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1007\/bf01303200","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T09:04:23Z","timestamp":1111741463000},"page":"147-155","source":"Crossref","is-referenced-by-count":41,"title":["Cycles through specified vertices"],"prefix":"10.1007","volume":"13","author":[{"given":"B\ufffdla","family":"Bollob\ufffds","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Graham","family":"Brightwell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1002\/jgt.3190100115","volume":"10","author":"N. Alon","year":"1986","unstructured":"N. Alon: The largest cycle of a graph with a large minimal degree,J. Graph Theory 10 (1986), 123?7.","journal-title":"J. Graph Theory"},{"key":"CR2","unstructured":"B. Bollob\u00e1s, andR. H\u00e4ggkvist: The circumference of a graph with given minimal degree,A Tribute to Paul Erd?s (A. Baker, B. Bollob\u00e1s and A. Hajnal eds.), Cambridge University Press 1989."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"G. A. Dirac","year":"1952","unstructured":"G. A. Dirac: Some theorems on abstract graphs,Proc. London Math. Soc. 2 (1952), 69?81.","journal-title":"Proc. London Math. Soc."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/0095-8956(89)90055-5","volume":"46","author":"Y. Egawa","year":"1989","unstructured":"Y. Egawa, andT. Miyamoto: The longest cycles in a graphG with minimum degree at least|G|\/k, J. Combinatorial Theory, Series B 46 (1989), 356?362.","journal-title":"J. Combinatorial Theory, Series B"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01303200.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01303200\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01303200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T14:08:44Z","timestamp":1556633324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01303200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["BF01303200"],"URL":"https:\/\/doi.org\/10.1007\/bf01303200","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}