{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:24:32Z","timestamp":1764174272913,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,8,12]],"date-time":"2016-08-12T00:00:00Z","timestamp":1470960000000},"content-version":"unspecified","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":[[2016,11]]},"DOI":"10.1007\/s00373-016-1729-4","type":"journal-article","created":{"date-parts":[[2016,8,12]],"date-time":"2016-08-12T04:02:00Z","timestamp":1470974520000},"page":"2295-2313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Chorded Cycles"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6895-8889","authenticated-orcid":false,"given":"Megan","family":"Cream","sequence":"first","affiliation":[]},{"given":"Ralph J.","family":"Faudree","sequence":"additional","affiliation":[]},{"given":"Ronald J.","family":"Gould","sequence":"additional","affiliation":[]},{"given":"Kazuhide","family":"Hirohata","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,12]]},"reference":[{"key":"1729_CR1","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."},{"key":"1729_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"GA 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":"1729_CR3","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. Gr. Comb. 16, 81\u201392 (2000)","journal-title":"Gr. Comb."},{"key":"1729_CR4","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. Gr. Theory 43, 188\u2013198 (2003)","journal-title":"J. Gr. Theory"},{"key":"1729_CR5","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":"1729_CR6","volume-title":"Graph Theory","author":"RJ Gould","year":"2012","unstructured":"Gould, R.J.: Graph Theory. Dover Pub. Inc., Mineola (2012)"},{"key":"1729_CR7","doi-asserted-by":"crossref","first-page":"6299","DOI":"10.1016\/j.disc.2008.04.017","volume":"309","author":"RJ Gould","year":"2009","unstructured":"Gould, R.J.: A look at cycles containing specified elements of a graph. Discrete Math. 309, 6299\u20136311 (2009)","journal-title":"Discrete Math."},{"key":"1729_CR8","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. Comb. 4, 105\u2013122 (2013)","journal-title":"J. Comb."},{"key":"1729_CR9","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, 160\u2013172 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"1729_CR10","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets. J. Lond. Math. Soc. 10, 26\u201330 (1935)","journal-title":"J. Lond. Math. Soc."},{"key":"1729_CR11","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 Appl. Math 120, 219\u2013237 (2002)","journal-title":"Discrete Appl. Math"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1729-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-016-1729-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1729-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T16:34:33Z","timestamp":1498322073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-016-1729-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,12]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["1729"],"URL":"https:\/\/doi.org\/10.1007\/s00373-016-1729-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2016,8,12]]}}}