{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:15Z","timestamp":1720640775616},"reference-count":8,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s1571-0653(04)00080-0","type":"journal-article","created":{"date-parts":[[2004,10,15]],"date-time":"2004-10-15T11:21:27Z","timestamp":1097839287000},"page":"358-364","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Traceability in Small Claw-Free Graphs"],"prefix":"10.1016","volume":"11","author":[{"given":"John M.","family":"Harris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael J.","family":"Mossinghoff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00080-0_NEWBIB1","series-title":"The Theory and Applications of Graphs: Fourth International Conference","first-page":"297","article-title":"Forbidden subgraphs and the Hamiltonian theme","author":"Duffus","year":"1981"},{"key":"10.1016\/S1571-0653(04)00080-0_NEWBIB2","unstructured":"R. Faudree, Forbidden subgraphs and Hamiltonian properties: A survey, in G. Chartrand and M. Jacobson, eds., Surveys in Graph Theory (San Francisco, 1995), Congr. Numer. 116 (1996), 33\u201352."},{"key":"10.1016\/S1571-0653(04)00080-0_NEWBIB3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0012-365X(96)00045-3","article-title":"Claw-free graphs \u2014 A survey","volume":"164","author":"Faudree","year":"1997","journal-title":"Discrete Math"},{"key":"10.1016\/S1571-0653(04)00080-0_NEWBIB4","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0095-8956(74)90061-6","article-title":"Sufficient conditions for a graph to be Hamiltonian","volume":"B 16","author":"Goodman","year":"1974","journal-title":"J. Combin. Theory Ser"},{"key":"10.1016\/S1571-0653(04)00080-0_NEWBIB5","unstructured":"M.M. Matthews, Every 3-connected K1,3-free graph with fewer than 20 vertices is Hamiltonian, Technical Report 82\u2013004, Dept. Comp. Sci., Univ. South Carolina, 1982."},{"key":"10.1016\/S1571-0653(04)00080-0_NEWBIB6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/jgt.3190080116","article-title":"Hamiltonian results in K1,3-free graphs","volume":"8","author":"Matthews","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/S1571-0653(04)00080-0_NEWBIB7","unstructured":"J.B. Mills, Traceability results in K1,3-free graphs, Masters Thesis, Dept. Math. Sci., Appalachian State Univ., 1997."},{"key":"10.1016\/S1571-0653(04)00080-0_NEWBIB8","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","article-title":"Congruent graphs and the connectivity of graphs","volume":"54","author":"Whitney","year":"1932","journal-title":"Amer. J. Math"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304000800?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304000800?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T21:54:36Z","timestamp":1549144476000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304000800"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":8,"alternative-id":["S1571065304000800"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00080-0","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}