{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:56:26Z","timestamp":1720054586169},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":5951,"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,4]]},"DOI":"10.1016\/s0012-365x(96)00238-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:07:02Z","timestamp":1027624022000},"page":"329-339","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Maximum and minimum toughness of graphs of small genus"],"prefix":"10.1016","volume":"167-168","author":[{"given":"Wayne","family":"Goddard","sequence":"first","affiliation":[]},{"given":"Michael D.","family":"Plummer","sequence":"additional","affiliation":[]},{"given":"Henda C.","family":"Swart","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00238-5_BIB1","first-page":"13","article-title":"Vulnerability in graphs \u2014 a comparative survey","volume":"1","author":"Barefoot","year":"1987","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/S0012-365X(96)00238-5_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\/S0012-365X(96)00238-5_BIB3","series-title":"Graphs and Digraphs","author":"Chartrand","year":"1986"},{"key":"10.1016\/S0012-365X(96)00238-5_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)00238-5_BIB5","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/BF02187810","article-title":"Toughness and Delaunay triangulations","volume":"5","author":"Dillencourt","year":"1990","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0012-365X(96)00238-5_BIB6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0012-365X(91)90099-N","article-title":"An upper bound on the shortness exponent of 1-tough, maximal planar graphs","volume":"90","author":"Dillencourt","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00238-5_BIB7","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1080\/16073606.1990.9631613","article-title":"On the toughness of a graph","volume":"13","author":"Goddard","year":"1990","journal-title":"Quaestiones Math."},{"key":"10.1016\/S0012-365X(96)00238-5_BIB8","first-page":"217","article-title":"Convex Polytopes","author":"Gr\u00fcnbaum","year":"1967"},{"key":"10.1016\/S0012-365X(96)00238-5_BIB9","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\/S0012-365X(96)00238-5_BIB10","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\/S0012-365X(96)00238-5_BIB11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0012-365X(83)90057-2","article-title":"Uniqueness and faithfulness of embedding of toroidal graphs","volume":"44","author":"Negami","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00238-5_BIB12","first-page":"225","article-title":"On the Toughness of a Graph","volume":"Vol. 303","author":"Pippert","year":"1972"},{"key":"10.1016\/S0012-365X(96)00238-5_BIB13","first-page":"139","article-title":"Das Geschlect des vollst\u00e4ndiger paaren Graphen","volume":"28","author":"Ringel","year":"1965"},{"key":"10.1016\/S0012-365X(96)00238-5_BIB14","article-title":"Map Color Theorem","volume":"Vol. 209","author":"Ringel","year":"1974"},{"key":"10.1016\/S0012-365X(96)00238-5_BIB15","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/0095-8956(79)90081-9","article-title":"Connectivity, genus and the number of components in vertex-deleted subgraphs","volume":"27","author":"Schmeichel","year":"1979","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96002385?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96002385?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T01:26:41Z","timestamp":1555982801000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96002385"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":15,"alternative-id":["S0012365X96002385"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00238-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}