{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:11:58Z","timestamp":1758823918201},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,6,21]],"date-time":"2012-06-21T00:00:00Z","timestamp":1340236800000},"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":[[2013,9]]},"DOI":"10.1007\/s00373-012-1200-0","type":"journal-article","created":{"date-parts":[[2012,6,20]],"date-time":"2012-06-20T08:42:21Z","timestamp":1340181741000},"page":"1337-1345","source":"Crossref","is-referenced-by-count":3,"title":["Neighborhood Unions for the Existence of Disjoint Chorded Cycles in Graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Yunshu","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guojun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,6,21]]},"reference":[{"key":"1200_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":"1200_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory, GTM 244","author":"J.A. Bondy","year":"2008","unstructured":"Bondy J.A., Murty U.S.R.: Graph Theory, GTM 244. Springer, New York (2008)"},{"key":"1200_CR3","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, 173\u2013186 (2010)","journal-title":"Graphs Combin."},{"key":"1200_CR4","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF01895727","volume":"14","author":"K. Corr\u00e1di","year":"1963","unstructured":"Corr\u00e1di K., Hajnal K.: 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":"1200_CR5","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":"1200_CR6","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. Discret. Math. 308, 5265\u20135268 (2008)","journal-title":"Discret. Math."},{"key":"1200_CR7","first-page":"29","volume":"76","author":"R.J. Faudree","year":"2005","unstructured":"Faudree R.J., Gould R.J.: A note on neighborhood unions and independent cycles. Ars Combin. 76, 29\u201331 (2005)","journal-title":"Ars Combin."},{"key":"1200_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(89)90060-9","volume":"47","author":"R.J. Faudree","year":"1989","unstructured":"Faudree R.J., Gould R.J., Jacobson M.S., Schelp R.H.: Neighborhood unions and hamiltonian properties of graphs. J. Combin. Theory Ser. B 47, 1\u20139 (1989)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1200_CR9","first-page":"415","volume":"98","author":"Y. Gao","year":"2011","unstructured":"Gao Y., Li G.: On the maximum number of disjoint chorded cycles in graphs. Ars Combin. 98, 415\u2013422 (2011)","journal-title":"Ars Combin."},{"key":"1200_CR10","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":"Akad. Mat. Kut. Int. K\u00f6zl"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1200-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1200-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1200-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:34Z","timestamp":1559055574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1200-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,21]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["1200"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1200-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,21]]}}}