{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T01:04:29Z","timestamp":1781139869046,"version":"3.54.1"},"reference-count":29,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"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":6316,"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":[[1996,4]]},"DOI":"10.1016\/0012-365x(95)00190-8","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"231-245","source":"Crossref","is-referenced-by-count":46,"title":["Toughness, hamiltonicity and split graphs"],"prefix":"10.1016","volume":"150","author":[{"given":"Dieter","family":"Kratsch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jen\u0151","family":"Lehel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haiko","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00190-8_BIB1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","article-title":"Linear time algorithms for NP-hard problems restricted to partial k-trees","volume":"23","author":"Arnborg","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(95)00190-8_BIB2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97062-7","volume":"I","author":"Balcaz\u00e1r","year":"1988","journal-title":"Structural Complexity"},{"key":"10.1016\/0012-365X(95)00190-8_BIB3","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\/0012-365X(95)00190-8_BIB4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/jgt.3190180304","article-title":"Toughness, minimum degree, and the existence of 2-factors","volume":"18","author":"Bauer","year":"1994","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(95)00190-8_BIB5","series-title":"Offprints from Graph Theory, Combinatorics, and Applications","first-page":"113","article-title":"Some recent results on long cycles in tough graphs","author":"Bauer","year":"1991"},{"key":"10.1016\/0012-365X(95)00190-8_BIB6","series-title":"Updating the last four years, in Kalamazoo Conf.","article-title":"Cycles in tough graphs","author":"Bauer","year":"1992"},{"key":"10.1016\/0012-365X(95)00190-8_BIB7","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0012-365X(95)00190-8_BIB8","series-title":"Schriftenreihe des FB Mathematik","article-title":"Special graph classes \u2014 a survey","author":"Brandst\u00e4dt","year":"1993"},{"key":"10.1016\/0012-365X(95)00190-8_BIB9","series-title":"Updated contributions to the Twente Workshop on Hamiltonian graph theory","year":"1992"},{"key":"10.1016\/0012-365X(95)00190-8_BIB10","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\/0012-365X(95)00190-8_BIB11","article-title":"Zur Kompliziertheit von hamiltonschen Problemen in speziellen Graphenklassen","author":"Damaschke","year":"1990"},{"key":"10.1016\/0012-365X(95)00190-8_BIB12","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF00571188","article-title":"Finding hamiltonian paths in cocomparability graphs using the bump number algorithm","volume":"8","author":"Damaschke","year":"1992","journal-title":"Order"},{"key":"10.1016\/0012-365X(95)00190-8_BIB13","article-title":"1-tough cocomparability graphs are hamiltonian","author":"Deogun","year":"1994"},{"key":"10.1016\/0012-365X(95)00190-8_BIB14","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1137\/S0097539791200375","article-title":"Hamiltonian cycle is polynomial on cocomparability graphs","volume":"23","author":"Deogun","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(95)00190-8_BIB15","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/jgt.3190090106","article-title":"Toughness and the existence of k-factors","volume":"9","author":"Enomoto","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(95)00190-8_BIB16","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(95)00190-8_BIB17","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0012-365X(95)00190-8_BIB18","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0012-365X(93)90519-Y","article-title":"Toughness and nonhamiltonicity of polyhedral graphs","volume":"113","author":"Harant","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00190-8_BIB19","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n52 algorithm for maximum matching in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Computing"},{"key":"10.1016\/0012-365X(95)00190-8_BIB20","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","article-title":"The NP-completeness column: an ongoing guide","volume":"6","author":"Johnson","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0012-365X(95)00190-8_BIB21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190110102","article-title":"Two sufficient conditions for a 2-factor in a bipartite graph","volume":"11","author":"Katerinis","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(95)00190-8_BIB22","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(85)90050-X","article-title":"Finding hamiltonian circuits in interval graphs","volume":"20","author":"Keil","year":"1985","journal-title":"Inform. Process. Letters"},{"key":"10.1016\/0012-365X(95)00190-8_BIB23","series-title":"The path partition of cocomparability graphs","author":"Lehel","year":"1991"},{"key":"10.1016\/0012-365X(95)00190-8_BIB24","series-title":"Matching Theory","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/0012-365X(95)00190-8_BIB25","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0020-0190(90)90025-S","article-title":"An optimum \u0398(n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals","volume":"35","author":"Manacher","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0012-365X(95)00190-8_BIB26","article-title":"The NP-completeness of HAMILTONIAN CIRCUIT for chordal bipartite graphs","author":"M\u00fcller","year":"1987"},{"key":"10.1016\/0012-365X(95)00190-8_BIB27","series-title":"The Many Facets of Graph Theory","first-page":"237","article-title":"Hamiltonian circuits in graphs and digraphs","author":"Williams","year":"1969"},{"key":"10.1016\/0012-365X(95)00190-8_BIB28","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first-search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(95)00190-8_BIB29","doi-asserted-by":"crossref","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","article-title":"The factors of graphs","volume":"4","author":"Tutte","year":"1952","journal-title":"Canad. J. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X95001908?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X95001908?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T16:27:31Z","timestamp":1556382451000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X95001908"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":29,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["0012365X95001908"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00190-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}