{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:16:04Z","timestamp":1758824164884},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"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":5191,"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":[[1999,5]]},"DOI":"10.1016\/s0012-365x(99)00021-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"101-120","source":"Crossref","is-referenced-by-count":6,"title":["Forbidden triples and traceability: a characterization"],"prefix":"10.1016","volume":"203","author":[{"given":"Ronald J.","family":"Gould","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John M.","family":"Harris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)00021-7_BIB1","unstructured":"D. Duffus, R.J. Gould, M.S. Jacobson, Forbidden subgraphs and the Hamiltonian theme, in: Chartrand et al. (Eds.), The Theory and Applications of Graphs, Wiley-Interscience, New York, 1981, pp. 297\u2013316."},{"key":"10.1016\/S0012-365X(99)00021-7_BIB2","doi-asserted-by":"crossref","unstructured":"R.J., Faudree, R.J. Gould, Characterizing forbidden pairs for Hamiltonian properties, Discrete Math., to appear.","DOI":"10.1016\/S0012-365X(96)00147-1"},{"key":"10.1016\/S0012-365X(99)00021-7_BIB3","unstructured":"R.J. Gould, Graph Theory. Benjamin\/Cummings Pub., Menlo Park, CA, 1988."},{"key":"10.1016\/S0012-365X(99)00021-7_BIB4","first-page":"183","article-title":"Forbidden triples of subgraphs and traceability","volume":"108","author":"Gould","year":"1995","journal-title":"Congressus Numerantium"},{"key":"10.1016\/S0012-365X(99)00021-7_BIB5","unstructured":"R.J. Gould, J.M. Harris, Traceability in graphs with forbidden triples of subgraphs, preprint."},{"key":"10.1016\/S0012-365X(99)00021-7_BIB6","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"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99000217?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99000217?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:24:58Z","timestamp":1556130298000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X99000217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["S0012365X99000217"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)00021-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}