{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T02:45:31Z","timestamp":1649126731178},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,4,26]],"date-time":"2014-04-26T00:00:00Z","timestamp":1398470400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s00373-014-1427-z","type":"journal-article","created":{"date-parts":[[2014,4,25]],"date-time":"2014-04-25T06:44:53Z","timestamp":1398408293000},"page":"897-914","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Intersections of Cycles in $$k$$ k -Connected Graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Jessica","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derrick","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,26]]},"reference":[{"key":"1427_CR1","unstructured":"Bondy, J.A.: Basic graph theory: paths and circuits. In: Handbook of combinatorics, vols. 1, 2, pp. 3\u2013110. Elsevier, Amsterdam (1995)"},{"key":"1427_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph theory with applications. American Elsevier Publishing Co., Inc, New York (1976)"},{"issue":"1","key":"1427_CR3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1006\/jctb.1997.1802","volume":"72","author":"G Chen","year":"1998","unstructured":"Chen, G., Faudree, R.J., Gould, R.J.: Intersections of longest cycles in $$k$$ k -connected graphs. J. Combin. Theory Ser. B 72(1), 143\u2013149 (1998)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1427_CR4","unstructured":"Chen, G., Hu, Z., Wu, Y.: Circumference of $$k$$ k -connected graphs involving independence numbers ii, manuscript"},{"issue":"1","key":"1427_CR5","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/jgt.20540","volume":"68","author":"G Chen","year":"2011","unstructured":"Chen, G., Hu, Z., Wu, Y.: Circumferences of $$k$$ k -connected graphs involving independence numbers. J. Graph Theory 68(1), 55\u201376 (2011)","journal-title":"J. Graph Theory"},{"key":"1427_CR6","doi-asserted-by":"crossref","unstructured":"Dirac, G.A.: Some theorems on abstract graphs. Proc. London Math. Soc. 2(3), 69\u201381 (1952)","DOI":"10.1112\/plms\/s3-2.1.69"},{"key":"1427_CR7","unstructured":"Fournier, I.: Thesis, Ph.D. thesis, University Paris-XI, Orsay (1982)"},{"key":"1427_CR8","doi-asserted-by":"crossref","unstructured":"Fournier, I.: Longest cycles in 2-connected graphs of independence number $$\\alpha $$ \u03b1 , Cycles in graphs. In: Burnaby, B.C. (ed.) North-Holland Math. Stud., vol. 115, pp. 201\u2013204. North-Holland, Amsterdam 1985 (1982)","DOI":"10.1016\/S0304-0208(08)73010-X"},{"key":"1427_CR9","unstructured":"Gr\u00f6tschel, M.: On intersections of longest cycles. In: Graph theory and combinatorics (Cambridge, 1983), pp. 171\u2013189. Academic Press, London (1984)"},{"issue":"1","key":"1427_CR10","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BF02591727","volume":"29","author":"M Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., Nemhauser, G.L.: A polynomial algorithm for the max-cut problem on graphs without long odd cycles. Math. Progr. 29(1), 28\u201340 (1984)","journal-title":"Math. Progr."},{"issue":"3","key":"1427_CR11","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s00373-009-0846-8","volume":"25","author":"Y Manoussakis","year":"2009","unstructured":"Manoussakis, Y.: Longest cycles in 3-connected graphs with given independence number. Graphs Combin. 25(3), 377\u2013384 (2009)","journal-title":"Graphs Combin."},{"issue":"6","key":"1427_CR12","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1016\/j.jctb.2011.02.005","volume":"101","author":"O Suil","year":"2011","unstructured":"Suil, O., West, D.B., Wu, H.: Longest cycles in $$k$$ k -connected graphs with given independence number. J. Combin. Theory Ser. B 101(6), 480\u2013485 (2011)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1427-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1427-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1427-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T21:56:08Z","timestamp":1565387768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1427-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,26]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["1427"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1427-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,26]]}}}