{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:35:32Z","timestamp":1742384132975},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":5280,"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,2]]},"DOI":"10.1016\/s0012-365x(98)00199-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"153-166","source":"Crossref","is-referenced-by-count":3,"title":["Distance graphs and the T-coloring problem"],"prefix":"10.1016","volume":"196","author":[{"given":"Albert","family":"Gr\u00e4f","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00199-X_BIB1","series-title":"Proc. 33rd Ann. IEEE Symp. on the Foundations of Computer Science","first-page":"14","article-title":"Proof verification and the hardness of approximation problems","author":"Arora","year":"1992"},{"key":"10.1016\/S0012-365X(98)00199-X_BIB2","article-title":"T-colorings of complete graphs","author":"Bonias","year":"1991"},{"key":"10.1016\/S0012-365X(98)00199-X_BIB3","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0097-3165(73)90003-4","article-title":"Sequences of integers with missing differences","volume":"14","author":"Cantor","year":"1973","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0012-365X(98)00199-X_BIB4","series-title":"Greedy algorithms for T-colorings of complete graphs and the meaningfulness of conclusions about them, manuscript","author":"Cozzens","year":"1991"},{"key":"10.1016\/S0012-365X(98)00199-X_BIB5","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0095-8956(85)90039-5","article-title":"Colouring the real line","volume":"39","author":"Eggleton","year":"1985","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(98)00199-X_BIB6","series-title":"A Guide to the Theory of NP-Completeness","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0012-365X(98)00199-X_BIB7","series-title":"The channel assignment problem for mutually adjacent sites, manuscript","author":"Griggs","year":"1992"},{"key":"10.1016\/S0012-365X(98)00199-X_BIB8","volume":"vol. I","author":"Halberstam","year":"1966"},{"key":"10.1016\/S0012-365X(98)00199-X_BIB9","first-page":"1497","article-title":"Frequency assignment: theory and applications","volume":"68","author":"Hale","year":"1980"},{"key":"10.1016\/S0012-365X(98)00199-X_BIB10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0012-365X(94)00344-I","article-title":"A rainbow about T-colorings for complete graphs","volume":"154","author":"Jansen","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00199-X_BIB11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1515\/crll.1961.206.53","article-title":"B2-Folgen und verwandte Zahlenfolgen","volume":"206","author":"Kr\u00fcckeberg","year":"1961","journal-title":"J. Reinen Angewandten Mathematik"},{"key":"10.1016\/S0012-365X(98)00199-X_BIB12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0012-365X(92)90603-D","article-title":"T-colorings of graphs","volume":"101","author":"Liu","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00199-X_BIB13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0012-365X(91)90258-4","article-title":"T-colorings of graphs: recent results and open problems","volume":"93","author":"Roberts","year":"1991","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/S0012-365X(98)00199-X_BIB14","first-page":"21","article-title":"On the chromatic number of distance graphs","volume":"28","author":"Voigt","year":"1992","journal-title":"J. Inform. Process. Cybernet. EIK"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9800199X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9800199X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T04:00:24Z","timestamp":1681185624000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X9800199X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0012365X9800199X"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00199-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}