{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T16:04:31Z","timestamp":1750349071938},"reference-count":3,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8963,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1989]]},"DOI":"10.1016\/0012-365x(89)90186-6","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T16:34:42Z","timestamp":1032280482000},"page":"307-313","source":"Crossref","is-referenced-by-count":12,"title":["Cycles of given length in some K1,3-free graphs"],"prefix":"10.1016","volume":"78","author":[{"given":"Cun-Quan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 3","key":"10.1016\/0012-365X(89)90186-6_bib1","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","article-title":"On maximal independent sets of vertices in claw-free graphs","volume":"28","author":"Minty","year":"1980","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(89)90186-6_bib2","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1002\/jgt.3190030405","article-title":"Every connected, locally connected nontrivial graph with no induced claw is hamiltonian","volume":"Vol. 3","author":"Oberly","year":"1979","journal-title":"J. Graph Theory"},{"issue":"No. 1","key":"10.1016\/0012-365X(89)90186-6_bib3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","article-title":"Algorithme de recherche d'un stable de cardinalit\u00e9maximum dans un graphe sans\u00e9toile","volume":"29","author":"Sbihi","year":"1980","journal-title":"Disc. Math. 29"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89901866?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89901866?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T17:22:28Z","timestamp":1554830548000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X89901866"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989]]}},"alternative-id":["0012365X89901866"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(89)90186-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1989]]}}}