{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:03Z","timestamp":1759063803844},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2011,8,26]],"date-time":"2011-08-26T00:00:00Z","timestamp":1314316800000},"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":[[2012,11]]},"DOI":"10.1007\/s00373-011-1078-2","type":"journal-article","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T05:59:34Z","timestamp":1314251974000},"page":"859-868","source":"Crossref","is-referenced-by-count":5,"title":["Length of Longest Cycles in a Graph Whose Relative Length is at Least Two"],"prefix":"10.1007","volume":"28","author":[{"given":"Kenta","family":"Ozeki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoki","family":"Yamashita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,8,26]]},"reference":[{"key":"1078_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(93)E0204-H","volume":"141","author":"D. Bauer","year":"1995","unstructured":"Bauer D., Broersma H.J., van den Heuvel J., Veldman H.J.: Long cycles in graphs with prescribed toughness and minimum degree. Discrete Math. 141, 1\u201310 (1995)","journal-title":"Discrete Math."},{"key":"1078_CR2","first-page":"41","volume":"15","author":"J.C. Bermond","year":"1976","unstructured":"Bermond J.C.: On hamiltonian walks. Congr. Numer. 15, 41\u201351 (1976)","journal-title":"Congr. Numer."},{"key":"1078_CR3","unstructured":"Bondy, J.A.: Longest paths and cycles in graphs with high degree, Research Report CORR 80-16, Department of Combinatorics and Optimization, University of Waterloo, Waterloo (1980)"},{"key":"1078_CR4","first-page":"5","volume-title":"Handbook of Combinatorics, vol. I","author":"J.A. Bondy","year":"1995","unstructured":"Bondy J.A.: Basic graph theory: paths and circuits. In: Graham, R., Gr\u0151tshel, M., Lov\u00e1sz, L. (eds) Handbook of Combinatorics, vol. I, pp. 5\u2013110. Elsevier, Amsterdam (1995)"},{"key":"1078_CR5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(81)90159-X","volume":"33","author":"J.A. Bondy","year":"1981","unstructured":"Bondy J.A., Locke S.C.: Relative length of paths and cycles in 3-connected graphs. Discrete Math. 33, 111\u2013122 (1981)","journal-title":"Discrete Math."},{"key":"1078_CR6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"G.A. Dirac","year":"1952","unstructured":"Dirac G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2, 69\u201381 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"key":"1078_CR7","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/0095-8956(89)90055-5","volume":"46","author":"Y. Egawa","year":"1989","unstructured":"Egawa Y., Miyamoto T.: The longest cycles in a graph G with minimum degree at least |G|\/k. J. Combin. Theory Ser. B 46, 356\u2013362 (1989)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1078_CR8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/1097-0118(200007)34:3<221::AID-JGT3>3.0.CO;2-T","volume":"34","author":"M.N. Ellingham","year":"2000","unstructured":"Ellingham M.N., Menser D.K.: Girth, minimum degree, and circumference. J. Graph Theory 34, 221\u2013233 (2000)","journal-title":"J. Graph Theory"},{"key":"1078_CR9","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1002\/jgt.3190200210","volume":"20","author":"H. Enomoto","year":"1995","unstructured":"Enomoto H., van den Heuvel J., Kaneko A., Saito A.: Relative length of long paths and cycles in graphs with large degree sums. J. Graph Theory 20, 213\u2013225 (1995)","journal-title":"J. Graph Theory"},{"key":"1078_CR10","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1002\/jgt.3190110413","volume":"11","author":"R.J. Faudree","year":"1987","unstructured":"Faudree R.J., Gould R.J., Jacobson M.S., Schelp R.H.: Extremal problems involving neighborhood unions. J. Graph Theory 11, 555\u2013564 (1987)","journal-title":"J. Graph Theory"},{"key":"1078_CR11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0095-8956(85)90035-8","volume":"39","author":"I. Fournier","year":"1985","unstructured":"Fournier I., Fraisse P.: On a conjecture of Bondy. J. Combin. Theory Ser. B 39, 17\u201326 (1985)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1078_CR12","first-page":"114","volume-title":"Recent Studies in Graph Theory","author":"P. Fraisse","year":"1989","unstructured":"Fraisse P., Jung H.A.: Longest cycles and independent sets in k-connected graphs. In: Kulli, V.R. (eds) Recent Studies in Graph Theory, pp. 114\u2013139. Vischwa International Publishing Gulbarga, India (1989)"},{"key":"1078_CR13","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1002\/(SICI)1097-0118(199906)31:2<107::AID-JGT4>3.0.CO;2-L","volume":"31","author":"H.A. Jung","year":"1999","unstructured":"Jung H.A., Witmann P.: Longest cycles in tough graphs. J. Graph Theory 31, 107\u2013127 (1999)","journal-title":"J. Graph Theory"},{"key":"1078_CR14","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1002\/jgt.1009","volume":"37","author":"R. Li","year":"2001","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)","journal-title":"J. Graph Theory"},{"key":"1078_CR15","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0012-365X(76)90031-5","volume":"15","author":"N. Linial","year":"1976","unstructured":"Linial N.: A lower bound for the circumference of a graph. Discrete Math. 15, 297\u2013300 (1976)","journal-title":"Discrete Math."},{"key":"1078_CR16","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0012-365X(95)00226-M","volume":"169","author":"X. Liu","year":"1997","unstructured":"Liu X.: Lower bounds of length of longest cycles in graphs involving neighborhood unions. Discrete Math. 169, 133\u2013144 (1997)","journal-title":"Discrete Math."},{"key":"1078_CR17","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0021-9800(67)80036-X","volume":"2","author":"O. Ore","year":"1967","unstructured":"Ore O.: On a graph theorem by Dirac. J. Combin. Theory 2, 383\u2013392 (1967)","journal-title":"J. Combin. Theory"},{"key":"1078_CR18","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/jgt.20403","volume":"62","author":"K. Ozeki","year":"2009","unstructured":"Ozeki K., Tsugaki M., Yamashita T.: On relative length of longest paths and cycles. J. Graph Theory 62, 279\u2013291 (2009)","journal-title":"J. Graph Theory"},{"key":"1078_CR19","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/(SICI)1097-0118(199902)30:2<91::AID-JGT3>3.0.CO;2-8","volume":"30","author":"A. Saito","year":"1999","unstructured":"Saito A.: Long paths, long cycles and their relative length. J. Graph Theory 30, 91\u201399 (1999)","journal-title":"J. Graph Theory"},{"key":"1078_CR20","unstructured":"Voss, H.-J.: Cycles and bridges in graphs. In: Mathematics and its Applications (East European Series), vol. 19, Kluwer Academic Publishers, Dordrecht (1991)"},{"key":"1078_CR21","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1002\/jgt.3190130409","volume":"13","author":"C.Q. Zhang","year":"1989","unstructured":"Zhang C.Q.: Circumference and girth. J. Graph Theory 13, 485\u2013490 (1989)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1078-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1078-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1078-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:33Z","timestamp":1559055513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1078-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,26]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["1078"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1078-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,26]]}}}