{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:53Z","timestamp":1759063853836},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"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":8598,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1016\/0012-365x(90)90029-h","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:43Z","timestamp":1027640623000},"page":"147-152","source":"Crossref","is-referenced-by-count":5,"title":["A simple proof of a theorem of Jung"],"prefix":"10.1016","volume":"79","author":[{"given":"Douglas","family":"Bauer","sequence":"first","affiliation":[]},{"given":"Aurora","family":"Morgana","sequence":"additional","affiliation":[]},{"given":"E.F.","family":"Schmeichel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0012-365X(90)90029-H_BIB1","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1112\/jlms\/s2-32.3.385","article-title":"Conditions for the existence of hamiltonian circuits in graphs based on vertex degrees","volume":"32","author":"Ainouche","year":"1985","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(90)90029-H_BIB2","unstructured":"D. Bauer and E. Schmeichel, Long cycles in tough graphs, to appear."},{"key":"10.1016\/0012-365X(90)90029-H_BIB3","unstructured":"D. Bauer, A. Morgana, E. Schmeichel and H.J. Veldman, Long cycles in graphs with large degree sums, to appear."},{"key":"10.1016\/0012-365X(90)90029-H_BIB4","unstructured":"D. Bauer, E. Schmeichel and H.J. Veldman, A generalization of a theorem of Bigalke and Jung, to appear."},{"key":"10.1016\/0012-365X(90)90029-H_BIB5","series-title":"Graphs and Digraphs","author":"Behzad","year":"1979"},{"key":"10.1016\/0012-365X(90)90029-H_BIB6","series-title":"Res. Rep. CORR 80-16","article-title":"Longest paths and cycles in graphs of high degree","author":"Bondy","year":"1980"},{"key":"10.1016\/0012-365X(90)90029-H_BIB7","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","article-title":"Tough graphs and hamiltonian circuits","volume":"5","author":"Chv\u00e1tal","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90029-H_BIB8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0167-5060(08)70503-X","article-title":"On maximal circuits in finite graph","volume":"3","author":"Jung","year":"1978","journal-title":"Ann. Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090029H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090029H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:51:59Z","timestamp":1555120319000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090029H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["0012365X9090029H"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90029-h","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}