{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T18:28:57Z","timestamp":1652552937507},"reference-count":9,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"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":6010,"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":[[1997,2]]},"DOI":"10.1016\/s0012-365x(96)00051-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"187-196","source":"Crossref","is-referenced-by-count":7,"title":["Toughness and edge-toughness"],"prefix":"10.1016","volume":"164","author":[{"given":"Gyula Y.","family":"Katona","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00051-9_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(93)E0204-H","article-title":"Long cycles in graphs with prescribed toughness and minimum degree","volume":"141","author":"Bauer","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00051-9_BIB2","series-title":"Proc. 7th Internat. Conf. on Graph Theory, Combinatorics, Algorithms, and Applications","article-title":"Cycles in tough graphs \u2014 Updating the last four years","author":"Bauer","year":"1992"},{"key":"10.1016\/S0012-365X(96)00051-9_BIB3","series-title":"Quo Vadis, Graph Theory?","first-page":"145","article-title":"Toughness and the cycle structure of graphs","volume":"55","author":"Bauer","year":"1993"},{"key":"10.1016\/S0012-365X(96)00051-9_BIB4","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\/S0012-365X(96)00051-9_BIB5","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\/S0012-365X(96)00051-9_BIB6_1","series-title":"Paths, Flows, and VLSI-layout","first-page":"215","article-title":"Cycles through prescribed elements in a graph","author":"Lomonosov","year":"1988"},{"key":"10.1016\/S0012-365X(96)00051-9_BIB6_2","article-title":"Cycles through prescribed elements in a graph","volume":"Vol. 9","author":"Lomenosov","year":"1990"},{"key":"10.1016\/S0012-365X(96)00051-9_BIB7","doi-asserted-by":"crossref","unstructured":"W. Mader \u00dcber die Maximalzahl kreuzungsfreier H-Wege, Arch. Math. 31, 387\u2013402.","DOI":"10.1007\/BF01226465"},{"key":"10.1016\/S0012-365X(96)00051-9_BIB8","series-title":"Updated Contributions to the Twente Workshop on Hamiltonian Graph Theory","first-page":"97","article-title":"Hamiltonian cycles in path-tough graphs","author":"Schiermeyer","year":"1992"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000519?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000519?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:28:56Z","timestamp":1556396936000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96000519"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0012365X96000519"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00051-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}