{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T02:22:38Z","timestamp":1784082158314,"version":"3.55.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"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":5433,"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":[[1998,9]]},"DOI":"10.1016\/s0012-365x(98)00099-5","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:18:15Z","timestamp":1049501895000},"page":"113-123","source":"Crossref","is-referenced-by-count":28,"title":["Coloring of integer distance graphs"],"prefix":"10.1016","volume":"191","author":[{"given":"Arnfried","family":"Kemnitz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Halka","family":"Kolberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00099-5_BIB1","series-title":"The chromatic number of distance graphs","author":"Deuber","year":"1995"},{"key":"10.1016\/S0012-365X(98)00099-5_BIB2","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 B"},{"key":"10.1016\/S0012-365X(98)00099-5_BIB3","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0012-365X(88)90184-7","article-title":"Update information to research problem 77","volume":"69","author":"Eggleton","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00099-5_BIB4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01787476","article-title":"Couloring prime distance graphs","volume":"6","author":"Eggleton","year":"1990","journal-title":"Graphs Combinatorics"},{"key":"10.1016\/S0012-365X(98)00099-5_BIB5","first-page":"456","article-title":"\u00dcber Matrizen aus nichtnegativen Elementen","author":"Frobenius","year":"1912","journal-title":"Sitzungsberichte Preuss. Akad. Wiss. Berlin"},{"key":"10.1016\/S0012-365X(98)00099-5_BIB6","first-page":"103","article-title":"Ungel\u00f6ste Probleme Nr. 40","volume":"16","author":"Hadwiger","year":"1961","journal-title":"Elemente Math."},{"key":"10.1016\/S0012-365X(98)00099-5_BIB7","series-title":"Graph Coloring Problems","author":"Jensen","year":"1995"},{"key":"10.1016\/S0012-365X(98)00099-5_BIB8","article-title":"F\u00e4rbungen von Distanzgraphen","author":"Kolberg","year":"1996"},{"key":"10.1016\/S0012-365X(98)00099-5_BIB9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1111\/j.1749-6632.1970.tb56482.x","article-title":"A linear diophantic equation with applications to nonnegative matrices","volume":"175","author":"Mendelsohn","year":"1970","journal-title":"Ann. New York Academ. Sci."},{"key":"10.1016\/S0012-365X(98)00099-5_BIB10","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":"Canadian Math. Bull."},{"key":"10.1016\/S0012-365X(98)00099-5_BIB11","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"},{"key":"10.1016\/S0012-365X(98)00099-5_BIB12","article-title":"Die chromatische Zahl einer speziellen Klasse unendlicher Graphen","author":"Voigt","year":"1992"},{"key":"10.1016\/S0012-365X(98)00099-5_BIB13","series-title":"F\u00e4rbung von Distanzgraphen","author":"Voigt","year":"1993"},{"key":"10.1016\/S0012-365X(98)00099-5_BIB14","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0166-218X(94)90109-0","article-title":"Chromatic number of prime distance graphs","volume":"51","author":"Voigt","year":"1994","journal-title":"Discrete App. Math."},{"key":"10.1016\/S0012-365X(98)00099-5_BIB15","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0012-365X(91)90454-A","article-title":"On the chromatic number of special distance graphs","volume":"97","author":"Voigt","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00099-5_BIB16","first-page":"268","article-title":"\u00dcber eine spezielle Klasse unendlicher Graphen","volume":"Bd. 2","author":"Walther","year":"1990"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98000995?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98000995?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,7]],"date-time":"2021-05-07T18:48:52Z","timestamp":1620413332000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98000995"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S0012365X98000995"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00099-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}