{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T23:46:35Z","timestamp":1772581595355,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":5280,"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":[[1999,2]]},"DOI":"10.1016\/s0012-365x(98)00334-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"29-50","source":"Crossref","is-referenced-by-count":43,"title":["Forbidden subgraphs, hamiltonicity and closure in claw-free graphs"],"prefix":"10.1016","volume":"196","author":[{"given":"Jan","family":"Brousek","sequence":"first","affiliation":[]},{"given":"Zden\u011bk","family":"Ryj\u00e1\u010dek","sequence":"additional","affiliation":[]},{"given":"Odile","family":"Favaron","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00334-3_BIB1","article-title":"Forbidden subgraph and minimum degree conditions for hamiltonicity","author":"Bedrossian","year":"1991"},{"key":"10.1016\/S0012-365X(98)00334-3_BIB2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0190(81)90048-X","article-title":"The edge hamiltonian path problem is NP-complete","volume":"13","author":"Bertossi","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0012-365X(98)00334-3_BIB3","series-title":"Graph theory with applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0012-365X(98)00334-3_BIB4","series-title":"Closure and stable hamiltonian properties in claw-free graphs","author":"Brandt","year":"1996"},{"key":"10.1016\/S0012-365X(98)00334-3_BIB5","series-title":"Contemporary methods in Graph Theory","first-page":"181","article-title":"Restrictions on induced subgraphs ensuring hamiltonicity or pancyclicity of K1,3-free graphs","author":"Broersma","year":"1990"},{"key":"10.1016\/S0012-365X(98)00334-3_BIB6","doi-asserted-by":"crossref","unstructured":"J. Brousek, Minimal 2-connected non-hamiltonian claw-free graphs, Discrete Math., to appear.","DOI":"10.1016\/S0012-365X(98)00093-4"},{"key":"10.1016\/S0012-365X(98)00334-3_BIB7","series-title":"The theory and applications of graphs, Kalamazoo, Mich. 1980","first-page":"297","article-title":"Forbidden subgraphs and the hamiltonian theme","author":"Duffus","year":"1981"},{"key":"10.1016\/S0012-365X(98)00334-3_BIB8","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\/S0012-365X(98)00334-3_BIB9","first-page":"13","article-title":"Forbidden subgraphs and pancyclicity","volume":"109","author":"Faudree","year":"1995"},{"key":"10.1016\/S0012-365X(98)00334-3_BIB10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0012-365X(96)00147-1","article-title":"Characterizing forbidden pairs for hamiltonian properties","volume":"173","author":"Faudree","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00334-3_BIB11","first-page":"109","article-title":"Forbidden subgraphs and cycle extendability","volume":"19","author":"Faudree","year":"1995","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/S0012-365X(98)00334-3_BIB12","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":"16","author":"Goodman","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(98)00334-3_BIB13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0012-365X(82)90216-3","article-title":"Forbidden subgraphs and hamiltonian properties of graphs","volume":"42","author":"Gould","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00334-3_BIB14","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"},{"key":"10.1016\/S0012-365X(98)00334-3_BIB15","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0095-8956(91)90074-T","article-title":"Hamiltonicity in claw-free graphs","volume":"53","author":"Shepherd","year":"1991","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98003343?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98003343?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:55:26Z","timestamp":1556132126000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98003343"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0012365X98003343"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00334-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}