{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T14:04:31Z","timestamp":1763388271509},"reference-count":8,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"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":4399,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0304-3975(00)00247-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"255-261","source":"Crossref","is-referenced-by-count":17,"title":["Partitioning vertices of 1-tough graphs into paths"],"prefix":"10.1016","volume":"263","author":[{"given":"Cristina","family":"Bazgan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amel","family":"Harkat-Benhamdine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mariusz","family":"Wo\u017aniak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00247-4_BIB1","unstructured":"D. Bauer, H.J. Broersma, H.J. Veldman, Not every 2-tough graph is hamiltonian, preprint 1997."},{"key":"10.1016\/S0304-3975(00)00247-4_BIB2","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0304-3975(00)00247-4_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\/S0304-3975(00)00247-4_BIB4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/jgt.3190090106","article-title":"Toughness and the existence of k-factors","volume":"9","author":"Enomote","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0304-3975(00)00247-4_BIB5","unstructured":"A. Kaneko, personal communication, 1998."},{"key":"10.1016\/S0304-3975(00)00247-4_BIB6","unstructured":"K. Ota, personal communication, 1998."},{"key":"10.1016\/S0304-3975(00)00247-4_BIB7","unstructured":"A. Saito, personal communication, 1998."},{"key":"10.1016\/S0304-3975(00)00247-4_BIB8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF01788671","article-title":"On a connection between the existence of the k-trees and the toughness of a graph","volume":"5","author":"Win","year":"1989","journal-title":"Graphs Combin."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002474?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002474?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T10:21:27Z","timestamp":1556792487000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002474"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":8,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0304397500002474"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00247-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}