{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T06:17:52Z","timestamp":1783491472147,"version":"3.55.0"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T00:00:00Z","timestamp":1668643200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T00:00:00Z","timestamp":1668643200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100013426","name":"Emory College of Arts and Sciences, Emory University","doi-asserted-by":"publisher","award":["0"],"award-info":[{"award-number":["0"]}],"id":[{"id":"10.13039\/100013426","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s00373-022-02586-9","type":"journal-article","created":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T20:03:50Z","timestamp":1668715430000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Results and Problems on Chorded Cycles: A Survey"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0040-9511","authenticated-orcid":false,"given":"Ronald J.","family":"Gould","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,11,17]]},"reference":[{"key":"2586_CR1","first-page":"193","volume":"51","author":"AA Ali","year":"1999","unstructured":"Ali, A.A., Staton, W.: The extremal question for cycles with chords. Ars Combin. 51, 193\u2013197 (1999)","journal-title":"Ars Combin."},{"key":"2586_CR2","first-page":"461","volume":"27","author":"BR Alspach","year":"1985","unstructured":"Alspach, B.R., Godsil, C.D.: Cycles in graphs. Ann. Discrete Math. 27, 461\u2013468 (1985)","journal-title":"Ann. Discrete Math."},{"key":"2586_CR3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01788136","volume":"7","author":"D Amar","year":"1991","unstructured":"Amar, D., Fournier, I., Germa, A.: Pancyclism in Chv\u00e1tal-Erd\u0151s\u2019s graphs. Graphs Combin. 7, 101\u2013112 (1991)","journal-title":"Graphs Combin."},{"key":"2586_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/jgt.20349","volume":"60","author":"CS Babu","year":"2009","unstructured":"Babu, C.S., Diwan, A.A.: Disjoint cycles with chords in graphs. J. Graph Theory 60, 87\u201398 (2009)","journal-title":"J. Graph Theory"},{"key":"2586_CR5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.jctb.2017.07.002","volume":"128","author":"P Balister","year":"2018","unstructured":"Balister, P., Li, H., Schelp, R.: Decompositions of graphs into cycles with chords. J. Combin. Theory Ser. B 128, 47\u201365 (2018)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"2586_CR6","first-page":"312","volume":"83","author":"K Beck","year":"2022","unstructured":"Beck, K., Cenek, L., Cream, M., Gelb, B.: Chorded pancyclic properties in claw-free graphs. Australas. J. Combin. 83(3), 312\u2013336 (2022)","journal-title":"Australas. J. Combin."},{"key":"2586_CR7","doi-asserted-by":"crossref","first-page":"5886","DOI":"10.1016\/j.disc.2007.10.040","volume":"308","author":"A Bialostocki","year":"2008","unstructured":"Bialostocki, A., Finkel, D., Gy\u00e1rf\u00e1s, A.: Disjoint chorded cycles in graphs. Discrete Math. 308, 5886\u20135890 (2008)","journal-title":"Discrete Math."},{"issue":"4","key":"2586_CR8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/jgt.20312","volume":"58","author":"E Birmel\u00e9","year":"2008","unstructured":"Birmel\u00e9, E.: Every longest circuit of a 3-connected, $$K_{3,3}$$-minor free graph has a chord. J. Graph Theory 58(4), 293\u2013298 (2008)","journal-title":"J. Graph Theory"},{"key":"2586_CR9","volume-title":"Extremal Graph Theory","author":"B Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s, B.: Extremal Graph Theory. Academic Press, London (1978)"},{"key":"2586_CR10","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1006\/jctb.1999.1916","volume":"77","author":"B Bollob\u00e1s","year":"1999","unstructured":"Bollob\u00e1s, B., Thomason, A.: Weakly pancyclic graphs. J. Combin. Theory Ser. B 77, 121\u2013137 (1999)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2586_CR11","unstructured":"Bondy, J.A., Pancyclic graphs, Proceedings of the Second Louisiana Conference on Combinatorics, Graph Theory, and Computing. Louisiana State Univ., Baton Rouge, LA, (1971), 167\u2013172"},{"key":"2586_CR12","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0095-8956(71)90016-5","volume":"11","author":"JA Bondy","year":"1971","unstructured":"Bondy, J.A.: Pancyclic graphs I. J. Combin. Theory Ser. B 11, 80\u201384 (1971)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2586_CR13","unstructured":"Brandt, S., Sufficient conditions for graphs to contain all subgraphs of a given type. Ph.D. Thesis, Freie Universitat Berlin, 1994"},{"issue":"3","key":"2586_CR14","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/(SICI)1097-0118(199803)27:3<141::AID-JGT3>3.0.CO;2-O","volume":"27","author":"S Brandt","year":"1998","unstructured":"Brandt, S., Faudree, R.J., Goddard, W.: Weakly pancyclic graphs. J. Graph Theory 27(3), 141\u2013176 (1998)","journal-title":"J. Graph Theory"},{"issue":"2","key":"2586_CR15","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/(SICI)1097-0118(199702)24:2<165::AID-JGT4>3.0.CO;2-O","volume":"24","author":"S Brandt","year":"1997","unstructured":"Brandt, S., Chen, G., Faudree, R.J., Gould, R.J., Lesniak, L.: Degree conditions for $$2$$-factors. J. Graph Theory 24(2), 165\u2013173 (1997)","journal-title":"J. Graph Theory"},{"issue":"2","key":"2586_CR16","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1137\/130929837","volume":"29","author":"G Chen","year":"2015","unstructured":"Chen, G., Gould, R.J., Hirohata, K., Ota, K., Shan, S.: Disjoint chorded cycles of the same length. SIAM J. Discrete Math. 29(2), 1030\u20131041 (2015)","journal-title":"SIAM J. Discrete Math."},{"key":"2586_CR17","doi-asserted-by":"crossref","first-page":"2131","DOI":"10.1016\/j.disc.2018.04.016","volume":"341","author":"G Chen","year":"2018","unstructured":"Chen, G., Gould, R.J., Gu, X., Saito, A.: Cycles with a chord in dense graphs. Discrete Math. 341, 2131\u20132141 (2018)","journal-title":"Discrete Math."},{"issue":"2","key":"2586_CR18","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s00373-010-0901-5","volume":"26","author":"S Chiba","year":"2010","unstructured":"Chiba, S., Fujita, S., Gao, Y., Li, G.: On a sharp degree sum condition for disjoint chorded cycles in graphs. Graphs Combin. 26(2), 173\u2013186 (2010)","journal-title":"Graphs Combin."},{"key":"2586_CR19","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1002\/jgt.22534","volume":"94","author":"S Chiba","year":"2020","unstructured":"Chiba, S., Jiang, S., Yan, J.: Partitioning a graph into cycles with a specified number of chords. J. Graph Theory 94, 463\u2013475 (2020)","journal-title":"J. Graph Theory"},{"key":"2586_CR20","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF01895727","volume":"14","author":"K Corr\u00e1di","year":"1963","unstructured":"Corr\u00e1di, K., Hajnal, A.: On the maximal number of independent circuits in a graph. Acta Math. Acad. Sci. Hungar. 14, 423\u2013439 (1963)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"2586_CR21","doi-asserted-by":"crossref","first-page":"2295","DOI":"10.1007\/s00373-016-1729-4","volume":"32","author":"M Cream","year":"2016","unstructured":"Cream, M., Faudree, R.J., Gould, R.J., Hirohata, K.: Chorded Cycles. Graphs Combin. 32, 2295\u20132313 (2016)","journal-title":"Graphs Combin."},{"key":"2586_CR22","unstructured":"Cream, M., Gould, R.J., Chorded $$k$$-pancyclic and weakly $$k$$-pancyclic graphs. Discuss. Math. Graph Theory. To appear"},{"key":"2586_CR23","first-page":"463","volume":"67","author":"M Cream","year":"2017","unstructured":"Cream, M., Gould, R.J., Hirohata, K.: A note on extending Bondy\u2019s meta-conjecture. Austral. J. of Combin. 67, 463\u2013469 (2017)","journal-title":"Austral. J. of Combin."},{"issue":"6","key":"2586_CR24","doi-asserted-by":"crossref","first-page":"1691","DOI":"10.1007\/s00373-018-1960-2","volume":"34","author":"M Cream","year":"2018","unstructured":"Cream, M., Gould, R.J., Hirohata, K.: Extending vertex and edge pancyclic graphs. Graphs Combin. 34(6), 1691\u20131711 (2018)","journal-title":"Graphs Combin."},{"key":"2586_CR25","doi-asserted-by":"crossref","first-page":"2878","DOI":"10.1016\/j.disc.2017.07.027","volume":"340","author":"M Cream","year":"2017","unstructured":"Cream, M., Gould, R.J., Larsen, V.: Forbidden subgraphs for chorded pancyclicity. Discrete Math. 340, 2878\u20132888 (2017)","journal-title":"Discrete Math."},{"key":"2586_CR26","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s00493-014-2897-6","volume":"34","author":"X Dahan","year":"2014","unstructured":"Dahan, X.: Regular graphs of large girth and arbitrary degree. Combinatorica 34, 407\u2013426 (2014)","journal-title":"Combinatorica"},{"issue":"1","key":"2586_CR27","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s003730050005","volume":"16","author":"Y Egawa","year":"2000","unstructured":"Egawa, Y., Faudree, R.J., Gy\u00f6ri, E., Ishigami, Y., Schelp, R., Wang, H.: Vertex-disjoint cycles containing specified edges. Graphs Combin. 16(1), 81\u201392 (2000)","journal-title":"Graphs Combin."},{"key":"2586_CR28","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1006\/jctb.1996.0015","volume":"66","author":"Y Egawa","year":"1996","unstructured":"Egawa, Y.: Vertex-disjoint cycles of the same length. J. Combin. Theory Ser. B 66, 168\u2013200 (1996)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2586_CR29","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1002\/jgt.10113","volume":"43","author":"Y Egawa","year":"2003","unstructured":"Egawa, Y., Enomoto, H., Faudree, R.J., Li, H., Schiermeyer, I.: Two-factors each component of which contains a specified vertex. J. Graph Theory 43, 188\u2013198 (2003)","journal-title":"J. Graph Theory"},{"issue":"6","key":"2586_CR30","doi-asserted-by":"crossref","first-page":"1927","DOI":"10.1007\/s00373-020-02227-z","volume":"36","author":"B Elliott","year":"2020","unstructured":"Elliott, B., Gould, R.J., Hirohata, K.: On degree sum conditions and vertex-disjoint chorded cycles. Graphs Combin. 36(6), 1927\u20131945 (2020)","journal-title":"Graphs Combin."},{"issue":"4","key":"2586_CR31","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s004930050034","volume":"18","author":"H Enomoto","year":"1998","unstructured":"Enomoto, H.: On the existence of disjoint cycles in a graph. Combinatorica 18(4), 487\u2013492 (1998)","journal-title":"Combinatorica"},{"key":"2586_CR32","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0012-365X(96)00147-1","volume":"173","author":"RJ Faudree","year":"1997","unstructured":"Faudree, R.J., Gould, R.J.: Characterizing forbidden pairs for hamiltonian properties. Discrete Math. 173, 45\u201360 (1997)","journal-title":"Discrete Math."},{"key":"2586_CR33","doi-asserted-by":"crossref","first-page":"1178","DOI":"10.1016\/j.disc.2007.12.094","volume":"309","author":"RJ Faudree","year":"2009","unstructured":"Faudree, R.J., Gould, R.J., Jacobson, M.S.: Pancyclic graphs and linear forests. Discrete Math. 309, 1178\u20131189 (2009)","journal-title":"Discrete Math."},{"key":"2586_CR34","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s00373-004-0576-x","volume":"20","author":"RJ Faudree","year":"2004","unstructured":"Faudree, R.J., Gould, R.J., Jacobson, M.S., Lesniak, L.: Generalizing pancyclic and $$k$$-ordered graphs. Graphs Combin. 20, 291\u2013309 (2004)","journal-title":"Graphs Combin."},{"key":"2586_CR35","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.1007\/s00373-018-1942-4","volume":"34","author":"D Ferrero","year":"2018","unstructured":"Ferrero, D., Lesniak, L.: Chorded pancyclicity in $$k$$-partite graphs. Graphs Combin. 34, 1565\u20131580 (2018)","journal-title":"Graphs Combin."},{"key":"2586_CR36","doi-asserted-by":"crossref","first-page":"5265","DOI":"10.1016\/j.disc.2007.09.035","volume":"308","author":"D Finkel","year":"2008","unstructured":"Finkel, D.: On the number of independent chorded cycles in a graph. Discrete Math. 308, 5265\u20135268 (2008)","journal-title":"Discrete Math."},{"key":"2586_CR37","first-page":"237","volume":"35","author":"S Fujita","year":"2006","unstructured":"Fujita, S., Matsumura, H., Tsugaki, M., Yamashita, T.: Degree sum conditions and vertex-disjoint cycles in a graph. Australas. J. Combin. 35, 237\u2013251 (2006)","journal-title":"Australas. J. Combin."},{"key":"2586_CR38","doi-asserted-by":"crossref","first-page":"1337","DOI":"10.1007\/s00373-012-1200-0","volume":"29","author":"Y Gao","year":"2013","unstructured":"Gao, Y., Li, G., Yan, J.: Neighborhood unions for the existence of disjoint chorded cycles in graphs. Graphs Combin. 29, 1337\u20131345 (2013)","journal-title":"Graphs Combin."},{"key":"2586_CR39","doi-asserted-by":"crossref","first-page":"2482","DOI":"10.1016\/j.disc.2019.05.028","volume":"342","author":"Y Gao","year":"2019","unstructured":"Gao, Y., Lin, X., Wang, H.: Vertex-disjoint double chorded cycles in bipartite graphs. Discrete Math. 342, 2482\u20132492 (2019)","journal-title":"Discrete Math."},{"key":"2586_CR40","doi-asserted-by":"crossref","unstructured":"Gao,Y., Wang, X.: The edge condition for independent cycles with chords in bipartite graphs. Appl. Math. Comput. 377, 125163, 7pp (2020)","DOI":"10.1016\/j.amc.2020.125163"},{"key":"2586_CR41","volume-title":"Graph Theory","author":"RJ Gould","year":"2012","unstructured":"Gould, R.J.: Graph Theory. Dover Pub. Inc., Mineola, N.Y. (2012)"},{"key":"2586_CR42","doi-asserted-by":"crossref","first-page":"2051","DOI":"10.1016\/j.disc.2015.05.010","volume":"338","author":"RJ Gould","year":"2015","unstructured":"Gould, R.J., Hirohata, K., Horn, P.: On independent doubly chorded cycles. Discrete Math. 338, 2051\u20132071 (2015)","journal-title":"Discrete Math."},{"key":"2586_CR43","first-page":"355","volume":"77","author":"RJ Gould","year":"2020","unstructured":"Gould, R.J., Hirohata, K., Keller, A.: On independent triples and vertex-disjoint chorded cycles in graphs. Australas. J. Combin. 77, 355\u2013372 (2020)","journal-title":"Australas. J. Combin."},{"issue":"1","key":"2586_CR44","first-page":"105","volume":"4","author":"RJ Gould","year":"2013","unstructured":"Gould, R.J., Hirohata, K., Horn, P.: Independent cycles and chorded cycles in graphs. J. Combin. 4(1), 105\u2013122 (2013)","journal-title":"J. Combin."},{"issue":"1","key":"2586_CR45","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1137\/12089569X","volume":"28","author":"RJ Gould","year":"2014","unstructured":"Gould, R.J., Horn, P., Magnant, C.: Multiply chorded cycles. SIAM J. Discrete Math. 28(1), 160\u2013172 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"2586_CR46","unstructured":"Hajnal, A., Szemer\u00e9di, E., Proof of a conjecture of P. Erd\u00f6s. In Combinatorial theorey and its applications, II (Proc. Colloq. Balatonf\u00fcred,pp. 601\u2013623, p. 1970. North Holland, Amsterdam (1969)"},{"key":"2586_CR47","doi-asserted-by":"crossref","unstructured":"Harvey, D.J.: A cycle of maximum order in a graph of high minimum degree has a chord. Electron. J. Combin. 24, no. 4, Paper No. 4.33, 8pp (2017)","DOI":"10.37236\/7152"},{"key":"2586_CR48","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(90)90163-C","volume":"83","author":"GRT Hendry","year":"1990","unstructured":"Hendry, G.R.T.: Extending cycles in graphs. Discrete Math. 83, 59\u201372 (1990)","journal-title":"Discrete Math."},{"issue":"3","key":"2586_CR49","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1002\/jgt.10179","volume":"46","author":"T Jiang","year":"2004","unstructured":"Jiang, T.: A note on a conjecture about cycles with many incident chords. J. Graph Theory 46(3), 180\u2013182 (2004)","journal-title":"J. Graph Theory"},{"key":"2586_CR50","first-page":"169","volume":"68","author":"J K\u00e1ra","year":"2003","unstructured":"K\u00e1ra, J., Kr\u00e1l, D.: Minimum degree and the number of chords. Ars Combin. 68, 169\u2013179 (2003)","journal-title":"Ars Combin."},{"key":"2586_CR51","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1002\/jgt.10007","volume":"39","author":"K Kawarabayashi","year":"2002","unstructured":"Kawarabayashi, K.: $$K_4^-$$-Factors in a graph. J. Graph Theory 39, 111\u2013128 (2002)","journal-title":"J. Graph Theory"},{"issue":"1","key":"2586_CR52","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejc.2005.07.017","volume":"28","author":"K Kawarabayashi","year":"2007","unstructured":"Kawarabayashi, K., Niu, J., Zhang, C.Q.: Chords of longest circuits in locally planar graphs. European J. Combin. 28(1), 315\u2013321 (2007)","journal-title":"European J. Combin."},{"key":"2586_CR53","doi-asserted-by":"crossref","unstructured":"Kostochka, A., Yager, D., Yu, G., Disjoint chorded cycles in graphs with high Ore-degree. Discrete Mathematics and Applications, 259\u2013304, Springer Optim. Appl., 165, Springer, Cham, (2020)","DOI":"10.1007\/978-3-030-55857-4_11"},{"issue":"1\u20133","key":"2586_CR54","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0012-365X(02)00688-X","volume":"268","author":"X Li","year":"2003","unstructured":"Li, X., Zhang, C.Q.: Chords of longest circuits in 3-connected graphs. Discrete Math. 268(1\u20133), 199\u2013206 (2003)","journal-title":"Discrete Math."},{"issue":"1","key":"2586_CR55","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.10091","volume":"43","author":"X Li","year":"2003","unstructured":"Li, X., Zhang, C.Q.: Chords of longest circuits embedded in torus and klein bottle. J. Graph Theory 43(1), 1\u201323 (2003)","journal-title":"J. Graph Theory"},{"key":"2586_CR56","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(96)80461-4","volume":"152","author":"D Lou","year":"1996","unstructured":"Lou, D.: The Chv\u00e1tal-Erd\u0151s condition for cycles in triangle-free graphs. Discrete Math. 152, 253\u2013257 (1996)","journal-title":"Discrete Math."},{"key":"2586_CR57","volume-title":"Combinatorial Problems and Exercises","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: Combinatorial Problems and Exercises. North-Holland Pub. Co., Amsterdam (1979)"},{"key":"2586_CR58","doi-asserted-by":"crossref","first-page":"2903","DOI":"10.1016\/j.disc.2018.07.003","volume":"341","author":"F Ma","year":"2018","unstructured":"Ma, F., Yan, J.: The confirmation of a conjecture on disjoint cycles in a graph. Discrete Math. 341, 2903\u20132911 (2018)","journal-title":"Discrete Math."},{"key":"2586_CR59","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s00373-016-1749-0","volume":"33","author":"T Molla","year":"2017","unstructured":"Molla, T., Santana, M., Yeager, E.: A refinement of theorems on vertex-disjoint chorded cycles. Graphs Combin. 33, 181\u2013201 (2017)","journal-title":"Graphs Combin."},{"key":"2586_CR60","doi-asserted-by":"crossref","unstructured":"Molla, T., Santana, M., Yeager, E.: Disjoint cycles and chorded cycles in a graph with given minimum degree. Discrete Math. 343(2020), No. 6, 111837, 20 pp","DOI":"10.1016\/j.disc.2020.111837"},{"key":"2586_CR61","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2308928","volume":"67","author":"O Ore","year":"1960","unstructured":"Ore, O.: Note on hamilton circuits. Amer. Math. Monthly 67, 55 (1960)","journal-title":"Amer. Math. Monthly"},{"key":"2586_CR62","first-page":"254","volume":"12","author":"L Posa","year":"1961","unstructured":"Posa, L.: Problem 127 (Hungarian) Mat. Lapok 12, 254 (1961)","journal-title":"Lapok"},{"key":"2586_CR63","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0095-8956(83)90067-9","volume":"35","author":"C Thomassen","year":"1983","unstructured":"Thomassen, C.: Girth in graphs. J. Combin. Theory Ser. B 35, 129\u2013141 (1983)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2586_CR64","doi-asserted-by":"crossref","unstructured":"Thomassen, C., Chords of longest cycles in cubic graphs. J. Combin. Theory, Series B, 71(2) (1997), 211\u2013214","DOI":"10.1006\/jctb.1997.1776"},{"key":"2586_CR65","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.jctb.2017.09.008","volume":"129","author":"C Thomassen","year":"2018","unstructured":"Thomassen, C.: Chords in longest cycles. J. Combin. Theory Ser. B 129, 148\u2013157 (2018)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2586_CR66","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1016\/j.disc.2011.10.012","volume":"312","author":"S Qiao","year":"2012","unstructured":"Qiao, S.: Neighborhood unions and disjoint chorded cycles in graphs. Discrete Math. 312, 891\u2013897 (2012)","journal-title":"Discrete Math."},{"key":"2586_CR67","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/j.orl.2010.09.007","volume":"38","author":"S Qiao","year":"2010","unstructured":"Qiao, S., Zhang, S.: Vertex-disjoint chorded cycles in a graph. Oper. Res. Lett. 38, 564\u2013566 (2010)","journal-title":"Oper. Res. Lett."},{"key":"2586_CR68","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0166-218X(01)00292-X","volume":"120","author":"B Randerath","year":"2002","unstructured":"Randerath, B., Schiermeyer, I., Tewes, M., Volkmann, L.: Vertex pancyclic graphs. Discrete Applied Math. 120, 219\u2013237 (2002)","journal-title":"Discrete Applied Math."},{"key":"2586_CR69","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0095-8956(02)00012-6","volume":"88","author":"J Verstra\u00ebte","year":"2003","unstructured":"Verstra\u00ebte, J.: Vertex-disjoint cycles of the same length. J. Combin. Theory Ser. B 88, 45\u201352 (2003)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2586_CR70","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0012-365X(97)00236-7","volume":"187","author":"H Wang","year":"1998","unstructured":"Wang, H.: Vertex-disjoint hexagons with chords in a bipartite graph. Discrete Math. 187, 221\u2013231 (1998)","journal-title":"Discrete Math."},{"key":"2586_CR71","doi-asserted-by":"crossref","unstructured":"Wang, H., On the maximum number of independent cycles in a graph. Discrete Math. 205 Issues 1\u20133 (1999), 183\u2013190","DOI":"10.1016\/S0012-365X(99)00009-6"},{"issue":"4","key":"2586_CR72","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1002\/jgt.3190110409","volume":"11","author":"CQ Zhang","year":"1987","unstructured":"Zhang, C.Q.: Longest cycles and their chords. J. Graph Theory 11(4), 521\u2013529 (1987)","journal-title":"J. Graph Theory"},{"key":"2586_CR73","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1137\/060665397","volume":"23","author":"Y Zhao","year":"2009","unstructured":"Zhao, Y.: Bipartite graph tiling. SIAM J. Discrete Math. 23, 888\u2013900 (2009)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02586-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02586-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02586-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T19:29:32Z","timestamp":1670614172000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02586-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,17]]},"references-count":73,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["2586"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02586-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,17]]},"assertion":[{"value":"26 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author would like to thank the referee for the careful reading and helpful suggestions.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"189"}}