{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:57:48Z","timestamp":1760245068359},"reference-count":9,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"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":5982,"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,3]]},"DOI":"10.1016\/s0012-365x(96)00170-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:36:38Z","timestamp":1027604198000},"page":"195-204","source":"Crossref","is-referenced-by-count":22,"special_numbering":"C","title":["The chromatic numbers of distance graphs"],"prefix":"10.1016","volume":"165-166","author":[{"given":"Walter A.","family":"Deuber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1976","series-title":"Graph Theory with Applications","author":"Bondy","key":"10.1016\/S0012-365X(96)00170-7_BIB1"},{"year":"1995","series-title":"Integral distance graphs","author":"Chang","key":"10.1016\/S0012-365X(96)00170-7_BIB2"},{"year":"1991","series-title":"Unsolved Problems in Geometry","author":"Croft","key":"10.1016\/S0012-365X(96)00170-7_BIB3"},{"key":"10.1016\/S0012-365X(96)00170-7_BIB4","first-page":"153","article-title":"New results on 3-chromatic prime distance graphs","volume":"B26","author":"Eggleton","year":"1988","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(96)00170-7_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(96)00170-7_BIB6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01787476","article-title":"Colouring prime distance graphs","volume":"32","author":"Eggleton","year":"1990","journal-title":"Graphs and Combin."},{"year":"1964","series-title":"Combinatorial Geometry in the Plane","author":"Hadwiger","key":"10.1016\/S0012-365X(96)00170-7_BIB7"},{"key":"10.1016\/S0012-365X(96)00170-7_BIB8","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1017\/S0008439500025753","article-title":"Solution to problem 10","volume":"4","author":"Moser","year":"1961","journal-title":"Canad. Math. Bull."},{"year":"1996","series-title":"Colouring the distance graphs","author":"Zhu","key":"10.1016\/S0012-365X(96)00170-7_BIB9"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96001707?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96001707?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,9]],"date-time":"2021-05-09T02:39:44Z","timestamp":1620527984000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96001707"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":9,"alternative-id":["S0012365X96001707"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00170-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}