{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T13:55:16Z","timestamp":1697637316561},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"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":7321,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1016\/0166-218x(93)90231-c","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:46:59Z","timestamp":1027655219000},"page":"191-203","source":"Crossref","is-referenced-by-count":5,"title":["\u00f8-threshold and \u00f8-tolerance chain graphs"],"prefix":"10.1016","volume":"44","author":[{"given":"M.S.","family":"Jacobson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Lehel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.M.","family":"Lesniak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90231-C_BIB1","series-title":"Res. Rept.","article-title":"Set-packing and threshold graphs","author":"Chvatal","year":"1973"},{"key":"10.1016\/0166-218X(93)90231-C_BIB2","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0166-218X(93)90231-C_BIB3","series-title":"Graph Theory, Combinatorics, and Applications","first-page":"705","article-title":"An introduction to tolerance intersection graphs","author":"Jacobson","year":"1991"},{"key":"10.1016\/0166-218X(93)90231-C_BIB4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/jgt.3190120307","article-title":"Threshold tolerance graphs","volume":"12","author":"Monma","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(93)90231-C_BIB5","series-title":"Proof Techniques in Graph Theory","first-page":"139","article-title":"Indifference graphs","author":"Roberts","year":"1969"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390231C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390231C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:51:18Z","timestamp":1555131078000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390231C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["0166218X9390231C"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90231-c","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}