{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T20:32:16Z","timestamp":1758054736456,"version":"3.44.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T00:00:00Z","timestamp":1591401600000},"content-version":"vor","delay-in-days":1466,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100006354","name":"Butler University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006354","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1016\/j.disc.2016.01.018","type":"journal-article","created":{"date-parts":[[2016,2,17]],"date-time":"2016-02-17T13:40:52Z","timestamp":1455716452000},"page":"1640-1650","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Circumferences of 3-connected claw-free graphs"],"prefix":"10.1016","volume":"339","author":[{"given":"Zhi-Hong","family":"Chen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"year":"1976","series-title":"Graph Theory with Applications","author":"Bondy","key":"10.1016\/j.disc.2016.01.018_br000005"},{"key":"10.1016\/j.disc.2016.01.018_br000010","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/jgt.3190120105","article-title":"A reduction method to find spanning Eulerian subgraphs","volume":"12","author":"Catlin","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2016.01.018_br000015","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0012-365X(95)00149-Q","article-title":"Graphs without spanning Eulerian trails","volume":"160","author":"Catlin","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2016.01.018_br000020","doi-asserted-by":"crossref","first-page":"2087","DOI":"10.1007\/s00373-014-1511-4","article-title":"Fan-type conditions for spanning Eulerian subgraphs","volume":"31","author":"Chen","year":"2015","journal-title":"Graphs Combin."},{"key":"10.1016\/j.disc.2016.01.018_br000025","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1002\/jgt.10094","article-title":"Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs","volume":"42","author":"Chen","year":"2003","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2016.01.018_br000030","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","article-title":"Some theorems on abstract graphs","volume":"2","author":"Dirac","year":"1952","journal-title":"Proc. Lond. Math. Soc."},{"key":"10.1016\/j.disc.2016.01.018_br000035","doi-asserted-by":"crossref","first-page":"701","DOI":"10.4153\/CMB-1965-051-3","article-title":"On Eulerian and Hamiltonian graphs and line graphs","volume":"8","author":"Harary","year":"1965","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/j.disc.2016.01.018_br000040","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/j.jctb.2005.10.003","article-title":"Hamiltonicity in 3-connected claw-free graphs","volume":"96","author":"Lai","year":"2006","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.disc.2016.01.018_br000045","doi-asserted-by":"crossref","first-page":"3580","DOI":"10.1016\/j.disc.2007.12.062","article-title":"Circumferences and minimum degrees in 3-connected claw-free graphs","volume":"309","author":"Li","year":"2009","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2016.01.018_br000050","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/jgt.3190090208","article-title":"Longest paths and cycles in K1,3-free graphs","volume":"9","author":"Mathews","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2016.01.018_br000055","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0020-0190(73)90029-X","article-title":"A max{m,n} algorithm for determining the graph H from its line graph G","volume":"2","author":"Roussopoulos","year":"1973","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.disc.2016.01.018_br000060","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1006\/jctb.1996.1732","article-title":"On a closure concept in claw-free graphs","volume":"70","author":"Ryj\u00e1\u010dek","year":"1997","journal-title":"J. Combin. Theory Ser. B"},{"year":"2005","series-title":"Claw-free graphs and line graphs","author":"Shao","key":"10.1016\/j.disc.2016.01.018_br000065"},{"key":"10.1016\/j.disc.2016.01.018_br000070","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0012-365X(92)00063-W","article-title":"On dominating and spanning circuits in graphs","volume":"124","author":"Veldman","year":"1994","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/j.disc.2016.01.018_br000075","first-page":"57","article-title":"Maximal gerade and ungerade kreise in graphen","volume":"23","author":"Voss","year":"1977","journal-title":"I. Wiss Z. Techn. Hochsch. Ilmenau"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X16000285?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X16000285?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T06:06:15Z","timestamp":1757916375000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X16000285"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["S0012365X16000285"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2016.01.018","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[2016,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Circumferences of 3-connected claw-free graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2016.01.018","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2016 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}