{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T07:34:28Z","timestamp":1771659268444,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"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":4276,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s0166-218x(01)00219-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:01:51Z","timestamp":1027591311000},"page":"99-115","source":"Crossref","is-referenced-by-count":1,"title":["A large set of non-Hamiltonian graphs"],"prefix":"10.1016","volume":"115","author":[{"given":"Gyula Y.","family":"Katona","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00219-0_BIB1","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0166-218X(99)00141-9","article-title":"Not every 2-tough graph is Hamiltonian","volume":"99","author":"Bauer","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00219-0_BIB2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0166-218X(90)90001-S","article-title":"Recognizing tough graphs is NP-hard","volume":"28","author":"Bauer","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00219-0_BIB3","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","article-title":"Tough graphs and Hamiltonian circuits","volume":"5","author":"Chv\u00e1tal","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00219-0_BIB4","unstructured":"V. Chv\u00e1tal, Hamiltonian cycles, The Traveling Salesman Problem, Wiley, New York, 1985 pp. 403\u2013429."},{"key":"10.1016\/S0166-218X(01)00219-0_BIB5","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0166-218X(97)00099-1","article-title":"Better approximations of non-Hamiltonian graphs","volume":"81","author":"Iwama","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00219-0_BIB6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0012-365X(96)00051-9","article-title":"Toughness and edge-toughness","volume":"164","author":"Katona","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00219-0_BIB7","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0022-0000(84)90068-0","article-title":"The complexity of facets (and some facets of complexity)","volume":"28","author":"Papadimitriu","year":"1984","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002190?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002190?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:56:10Z","timestamp":1556884570000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002190"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S0166218X01002190"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00219-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}