{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T22:01:11Z","timestamp":1772661671441,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"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":11885,"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":[[1981]]},"DOI":"10.1016\/0012-365x(81)90159-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:33:13Z","timestamp":1027639993000},"page":"111-122","source":"Crossref","is-referenced-by-count":24,"title":["Relative lengths of paths and cycles in 3-connected graphs"],"prefix":"10.1016","volume":"33","author":[{"given":"J.A.","family":"Bondy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.C.","family":"Locke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(81)90159-X_BIB1","series-title":"Proc. First Canada-France Combinatorial Colloquium","first-page":"253","article-title":"Relative lengths of paths and cycles in k-connected graphs","volume":"Vol. 8","author":"Bondy","year":"1980"},{"key":"10.1016\/0012-365X(81)90159-X_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(81)90159-X_BIB3","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01349245","article-title":"Graphs in which every finite path is contained in a circuit","volume":"203","author":"Dirac","year":"1973","journal-title":"Math. Ann."},{"key":"10.1016\/0012-365X(81)90159-X_BIB4","unstructured":"S.C. Locke, Relative lengths of paths and cycles in k-connected graphs, in preparation."},{"key":"10.1016\/0012-365X(81)90159-X_BIB5","unstructured":"C. Thomassen, personal communication."},{"key":"10.1016\/0012-365X(81)90159-X_BIB6","first-page":"139","article-title":"Eigenscharten zweifach zusammenh\u00e4ngender Graphen mit vorgeschreibener Maximal-krersl:ange","volume":"3","author":"Voss","year":"1973","journal-title":"Mitt Math. Gesellsch. DDR"},{"key":"10.1016\/0012-365X(81)90159-X_BIB7","unstructured":"N. Wormald, personal communication."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X8190159X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X8190159X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:25:43Z","timestamp":1555140343000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X8190159X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981]]}},"alternative-id":["0012365X8190159X"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(81)90159-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1981]]}}}