{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T03:25:06Z","timestamp":1777433106973,"version":"3.51.4"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,2,24]],"date-time":"2010-02-24T00:00:00Z","timestamp":1266969600000},"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":[[2010,3]]},"DOI":"10.1007\/s00373-010-0901-5","type":"journal-article","created":{"date-parts":[[2010,2,22]],"date-time":"2010-02-22T20:39:11Z","timestamp":1266871151000},"page":"173-186","source":"Crossref","is-referenced-by-count":18,"title":["On a Sharp Degree Sum Condition for Disjoint Chorded Cycles in Graphs"],"prefix":"10.1007","volume":"26","author":[{"given":"Shuya","family":"Chiba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinya","family":"Fujita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunshu","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guojun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,24]]},"reference":[{"key":"901_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. Discret. Math. 308, 5886\u20135890 (2008)","journal-title":"Discret. Math."},{"key":"901_CR2","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":"901_CR3","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, 487\u2013492 (1998)","journal-title":"Combinatorica"},{"key":"901_CR4","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 cycle in a graph. Discret. Math. 308, 5265\u20135268 (2008)","journal-title":"Discret. Math."},{"key":"901_CR5","first-page":"355","volume":"8","author":"L. P\u00f3sa","year":"1964","unstructured":"P\u00f3sa L.: On the circuits of finite graphs. Magyar Tud. Akad. Mat. Kut. Int. K\u00f6zl. 8, 355\u2013361 (1964)","journal-title":"Magyar Tud. Akad. Mat. Kut. Int. K\u00f6zl."},{"key":"901_CR6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0012-365X(99)00009-6","volume":"205","author":"H. Wang","year":"1999","unstructured":"Wang H.: On the maximum number of independent cycles in a graph. Discret. Math. 205, 183\u2013190 (1999)","journal-title":"Discret. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0901-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0901-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0901-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:30Z","timestamp":1559041110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0901-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,24]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["901"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0901-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,24]]}}}