{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T07:17:58Z","timestamp":1712301478759},"reference-count":14,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"vor","delay-in-days":1466,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1016\/j.disc.2015.05.010","type":"journal-article","created":{"date-parts":[[2015,6,6]],"date-time":"2015-06-06T03:01:10Z","timestamp":1433559670000},"page":"2051-2071","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["On independent doubly chorded cycles"],"prefix":"10.1016","volume":"338","author":[{"given":"Ronald J.","family":"Gould","sequence":"first","affiliation":[]},{"given":"Kazuhide","family":"Hirohata","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Horn","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2015.05.010_br000005","doi-asserted-by":"crossref","first-page":"5886","DOI":"10.1016\/j.disc.2007.10.040","article-title":"Disjoint chorded cycles in graphs","volume":"308","author":"Bialostocki","year":"2008","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2015.05.010_br000010","series-title":"Graphs & Digraphs","author":"Chartrand","year":"2005"},{"key":"10.1016\/j.disc.2015.05.010_br000015","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s00373-010-0901-5","article-title":"On a sharp degree sum condition for disjoint chorded cycles in graphs","volume":"26","author":"Chiba","year":"2010","journal-title":"Graphs Combin."},{"key":"10.1016\/j.disc.2015.05.010_br000020","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF01895727","article-title":"On the maximal number of independent circuits in a graph","volume":"14","author":"Corr\u00e1di","year":"1963","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/j.disc.2015.05.010_br000025","first-page":"464","article-title":"A combinatorial problem in geometry","volume":"2","author":"Erd\u0151s","year":"1935","journal-title":"Composito Math."},{"key":"10.1016\/j.disc.2015.05.010_br000030","doi-asserted-by":"crossref","first-page":"5265","DOI":"10.1016\/j.disc.2007.09.035","article-title":"On the number of independent chorded cycles in a graph","volume":"308","author":"Finkel","year":"2008","journal-title":"Discrete Math."},{"issue":"21","key":"10.1016\/j.disc.2015.05.010_br000035","doi-asserted-by":"crossref","first-page":"6299","DOI":"10.1016\/j.disc.2008.04.017","article-title":"A look at cycles containing specified elements of a graph","volume":"309","author":"Gould","year":"2009","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.disc.2015.05.010_br000040","first-page":"105","article-title":"Independent cycles and chorded cycles in graphs","volume":"4","author":"Gould","year":"2013","journal-title":"J. Comb."},{"issue":"1","key":"10.1016\/j.disc.2015.05.010_br000045","doi-asserted-by":"crossref","DOI":"10.1137\/12089569X","article-title":"Multiply chorded cycles","volume":"28","author":"Gould","year":"2014","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2015.05.010_br000050","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1993"},{"key":"10.1016\/j.disc.2015.05.010_br000055","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2308928","article-title":"A note on Hamilton circuits","volume":"67","author":"Ore","year":"1960","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/j.disc.2015.05.010_br000060","first-page":"254","article-title":"Problem no. 127 (Hungarian)","volume":"12","author":"P\u00f3sa","year":"1961","journal-title":"Mat. Lapok"},{"key":"10.1016\/j.disc.2015.05.010_br000065","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/j.orl.2010.09.007","article-title":"Vertex-disjoint chorded cycles in a graph","volume":"38","author":"Qiao","year":"2010","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.disc.2015.05.010_br000070","series-title":"An Atlas of Graphs","author":"Read","year":"1998"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X15001831?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X15001831?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T21:04:50Z","timestamp":1572987890000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X15001831"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":14,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["S0012365X15001831"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2015.05.010","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2015,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On independent doubly chorded cycles","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2015.05.010","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}