{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T11:48:01Z","timestamp":1649072881911},"reference-count":6,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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":8963,"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":[[1989]]},"DOI":"10.1016\/0012-365x(89)90177-5","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T22:04:08Z","timestamp":1034287448000},"page":"195-211","source":"Crossref","is-referenced-by-count":0,"title":["Bridges of longest cycles"],"prefix":"10.1016","volume":"78","author":[{"given":"Cun-Quan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(89)90177-5_BIB1","series-title":"The Theory and Applications of Graphs","first-page":"117","article-title":"Integrity in Graph Theory","author":"Bondy","year":"1981"},{"issue":"3","key":"10.1016\/0012-365X(89)90177-5_BIB2","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\/0012-365X(89)90177-5_BIB3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0095-8956(85)90035-8","article-title":"On a conjecture of Bondy","volume":"39","author":"Fournier","year":"1985","journal-title":"J. Conbin. Theory B"},{"key":"10.1016\/0012-365X(89)90177-5_BIB4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0012-365X(76)90031-5","article-title":"A lower bound for the circumference of a graph","volume":"15","author":"Linial","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(89)90177-5_BIB5","series-title":"Studies in Pure Mathematics","first-page":"157","article-title":"Edge-disjoint hamiltonian circuits in graphs with vertices of large valency","author":"Nash-Williams","year":"1971"},{"key":"10.1016\/0012-365X(89)90177-5_BIB6","first-page":"275","article-title":"Bridges of longest circuits and longest paths in graphs","author":"Voss","year":"1977","journal-title":"Beitrage Zur Graphentheorie und deren Auwendungen"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89901775?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89901775?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:22:20Z","timestamp":1555190540000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X89901775"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"references-count":6,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1989]]}},"alternative-id":["0012365X89901775"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(89)90177-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1989]]}}}