{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T23:08:01Z","timestamp":1723158481485},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2007,3,31]],"date-time":"2007-03-31T00:00:00Z","timestamp":1175299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2007,8,16]]},"DOI":"10.1007\/s10878-007-9053-9","type":"journal-article","created":{"date-parts":[[2007,3,30]],"date-time":"2007-03-30T17:03:04Z","timestamp":1175274184000},"page":"267-274","source":"Crossref","is-referenced-by-count":1,"title":["Distance graphs on R n with 1-norm"],"prefix":"10.1007","volume":"14","author":[{"given":"Jer-Jeong","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerard J.","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,3,31]]},"reference":[{"key":"9053_CR1","unstructured":"Chen JJ (1996) Distance graphs. PhD thesis, Department of Applied Mathematics, National Chiao Tung University"},{"key":"9053_CR2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1002\/(SICI)1097-0118(199708)25:4<287::AID-JGT6>3.0.CO;2-G","volume":"25","author":"JJ Chen","year":"1997","unstructured":"Chen JJ, Chang GJ, Huang KC (1997) Integral distance graphs. J Graph Theory 25:287\u2013294","journal-title":"J Graph Theory"},{"key":"9053_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0963-8","volume-title":"Unsolved problems in geometry","author":"HT Croft","year":"1991","unstructured":"Croft HT, Falconer KJ, Guy RK (1991) Unsolved problems in geometry. Springer, New York"},{"key":"9053_CR4","unstructured":"Eggleton RB (1991) Distance graphs and their chromatic numbers. In: Workshop notes of conference of graph theory and combinatorics, Manila"},{"key":"9053_CR5","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0095-8956(85)90039-5","volume":"39","author":"RB Eggleton","year":"1985","unstructured":"Eggleton RB, Erd\u0151s P, Skilton DK (1985) Colouring the real line. J Comb Theory Ser B 39:86\u2013100","journal-title":"J Comb Theory Ser B"},{"key":"9053_CR6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01787476","volume":"6","author":"RB Eggleton","year":"1990","unstructured":"Eggleton RB, Erd\u0151s P, Skilton DK (1990) Colouring prime distance graphs. Graphs Comb 6:17\u201332","journal-title":"Graphs Comb"},{"key":"9053_CR7","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/j.tcs.2004.02.010","volume":"319","author":"Z F\u0171redi","year":"2004","unstructured":"F\u0171redi Z, Kang JH (2004) Distance graphs on Z n with \u2113 1 norm. Theor Comput Sci 319:357\u2013366","journal-title":"Theor Comput Sci"},{"key":"9053_CR8","unstructured":"F\u0171redi Z, Kang JH (2007) Covering n-space by convex bodies and its chromatic number. Discret Math (to appear)"},{"key":"9053_CR9","volume-title":"Combinatorial geometry in the plane","author":"H Hadwiger","year":"1964","unstructured":"Hadwiger H, Debrunner H, Klee V (1964) Combinatorial geometry in the plane. Rinehart and Winston, New York"},{"key":"9053_CR10","volume-title":"Graph coloring problems","author":"TR Jensen","year":"1995","unstructured":"Jensen TR, Toft B (1995) Graph coloring problems. Wiley, New York"},{"key":"9053_CR11","first-page":"187","volume":"4","author":"L Moser","year":"1961","unstructured":"Moser L, Moser W (1961) Solution to problem 10. Can Math Bull 4:187\u2013189","journal-title":"Can Math Bull"},{"key":"9053_CR12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.4213\/rm358","volume":"56","author":"AM Raigorodskii","year":"2001","unstructured":"Raigorodskii AM (2001) Borsuk\u2019s problem and the chromatic number of some metric spaces. Usp Mat Nauk 56:107\u2013146; translated in Russ Math Surv 56:103\u2013139","journal-title":"Usp Mat Nauk"},{"key":"9053_CR13","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0012-365X(91)90454-A","volume":"97","author":"M Voigt","year":"1991","unstructured":"Voigt M, Walther H (1991) On the chromatic number of special distance graphs. Discret Math 97:395\u2013397","journal-title":"Discret Math"},{"key":"9053_CR14","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0166-218X(94)90109-0","volume":"51","author":"M Voigt","year":"1994","unstructured":"Voigt M, Walther H (1994) Chromatic number of prime distance graphs. Discret Appl Math 51:197\u2013209","journal-title":"Discret Appl Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9053-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9053-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9053-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:11Z","timestamp":1559261891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9053-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,31]]},"references-count":14,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2007,8,16]]}},"alternative-id":["9053"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9053-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,31]]}}}