{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T16:17:11Z","timestamp":1778689031167,"version":"3.51.4"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,8,1]],"date-time":"2007-08-01T00:00:00Z","timestamp":1185926400000},"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":[[2007,8]]},"DOI":"10.1007\/s00373-007-0740-1","type":"journal-article","created":{"date-parts":[[2007,7,27]],"date-time":"2007-07-27T09:03:06Z","timestamp":1185526986000},"page":"433-443","source":"Crossref","is-referenced-by-count":6,"title":["Relative Length of Longest Paths and Cycles in Graphs"],"prefix":"10.1007","volume":"23","author":[{"given":"Huiqing","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mei","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"740_CR1","unstructured":"Bondy, J.A.: Longest paths and cycles in graphs of high degree, Research Report CORR 80-16, University of Waterloo, Waterloo, Ontario, 1980"},{"key":"740_CR2","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, Macmillan, London and Elsevier, New York, 1976","DOI":"10.1007\/978-1-349-03521-2"},{"key":"740_CR3","doi-asserted-by":"crossref","unstructured":"Broersma, H.J., Lu, M.: Cycles through particular subgraphs of claw-free graphs, J. Graph Theory 20, 459\u2013465 (1995)","DOI":"10.1002\/jgt.3190200409"},{"key":"740_CR4","doi-asserted-by":"crossref","unstructured":"Enomoto, H., van den Heuvel, J., Kaneko, A., Saito, A.: Relative length of longest paths and cycles in graphs with large degree sums, J. Graph Theory 20, 213\u2013225 (1995)","DOI":"10.1002\/jgt.3190200210"},{"key":"740_CR5","doi-asserted-by":"crossref","unstructured":"Li, R., Saito, A., Schelp, R.H.: Relative length of longest paths and cycles in 3-connected graphs, J. Graph Theory 37, 137\u2013156 (2001)","DOI":"10.1002\/jgt.1009"},{"key":"740_CR6","doi-asserted-by":"crossref","unstructured":"Lu, M., Liu, H., Tian, F.: Two sufficient condition for dominating cycles, J. Graph Theory 49, 135\u2013150 (2005)","DOI":"10.1002\/jgt.20070"},{"key":"740_CR7","unstructured":"Schiermeyer, I., Tewes, M.: Longest paths and longest cycles in graphs with large degree sumes, Graphs Combin. 18, 633\u2013643 (2002)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0740-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-007-0740-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0740-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:27Z","timestamp":1559041107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-007-0740-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,8]]}},"alternative-id":["740"],"URL":"https:\/\/doi.org\/10.1007\/s00373-007-0740-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8]]}}}