{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:40:27Z","timestamp":1743104427646,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319193144"},{"type":"electronic","value":"9783319193151"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19315-1_22","type":"book-chapter","created":{"date-parts":[[2015,6,6]],"date-time":"2015-06-06T10:42:08Z","timestamp":1433587328000},"page":"250-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Study of $$\\kappa (D)$$ for $$D = \\{2, 3, x, y\\}$$"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Collister","sequence":"first","affiliation":[]},{"given":"Daphne Der-Fen","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,7]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"#R48","DOI":"10.37236\/772","volume":"15","author":"J Barajas","year":"2008","unstructured":"Barajas, J., Serra, O.: The lonely runner with seven runners. Electron. J. Combin. 15, #R48 (2008)","journal-title":"Electron. J. Combin."},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jctb.1997.1770","volume":"72","author":"W Bienia","year":"1998","unstructured":"Bienia, W., Goddyn, L., Gvozdjak, P., Seb\u0151, A., Tarsi, M.: Flows, view obstructions, and the lonely runner. J. Combin. Theory Ser. B 72, 1\u20139 (1998)","journal-title":"J. Combin. Theory Ser. B"},{"key":"22_CR3","first-page":"49","volume":"8","author":"T Bohman","year":"2001","unstructured":"Bohman, T., Holzman, R., Kleitman, D.: Six lonely runners. Electron. J. Comb. 8, 49 (2001). Research Paper 3","journal-title":"Electron. J. Comb."},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0097-3165(73)90003-4","volume":"14","author":"D Cantor","year":"1973","unstructured":"Cantor, D., Gordon, B.: Sequences of integers with missing differences. J. Comb. Theory Ser. A 14, 281\u2013287 (1973)","journal-title":"J. Comb. Theory Ser. A"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/jctb.1998.1881","volume":"75","author":"G Chang","year":"1999","unstructured":"Chang, G., Liu, D., Zhu, X.: Distance graphs and $$T$$-coloring. J. Comb. Theory Ser. B 75, 159\u2013169 (1999)","journal-title":"J. Comb. Theory Ser. B"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0097-3165(74)90066-1","volume":"16","author":"T Cusick","year":"1974","unstructured":"Cusick, T.: View-obstruction problems in $$n$$-dimensional geometry. J. Comb. Theory Ser. A 16, 1\u201311 (1974)","journal-title":"J. Comb. Theory Ser. A"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0022-314X(84)90097-0","volume":"19","author":"T Cusick","year":"1984","unstructured":"Cusick, T., Pomerance, C.: View-obstruction problems, III. J. Number Theory 19, 131\u2013139 (1984)","journal-title":"J. Number Theory"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0095-8956(85)90039-5","volume":"39","author":"R Eggleton","year":"1985","unstructured":"Eggleton, R., Erd\u0151s, P., Skilton, D.: Colouring the real line. J. Comb. Theory Ser. A 39, 86\u2013100 (1985)","journal-title":"J. Comb. Theory Ser. A"},{"key":"22_CR9","first-page":"323","volume":"58","author":"R Eggleton","year":"1986","unstructured":"Eggleton, R., Erd\u0151s, P., Skilton, D.: Research problem 77. Discrete Math. 58, 323 (1986)","journal-title":"Discrete Math."},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01787476","volume":"6","author":"R Eggleton","year":"1990","unstructured":"Eggleton, R., Erd\u0151s, P., Skilton, D.: Colouring prime distance graphs. Graphs Comb. 6, 17\u201332 (1990)","journal-title":"Graphs Comb."},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1006\/jcta.1999.3003","volume":"89","author":"S Gupta","year":"2000","unstructured":"Gupta, S.: Sets of integers with missing differences. J. Comb. Theory Ser. A 89, 55\u201369 (2000)","journal-title":"J. Comb. Theory Ser. A"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/0097-3165(77)90076-0","volume":"23","author":"N Haralambis","year":"1997","unstructured":"Haralambis, N.: Sets of integers with missing differences. J. Comb. Theory Ser. A 23, 22\u201333 (1997)","journal-title":"J. Comb. Theory Ser. A"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0012-365X(98)00099-5","volume":"191","author":"A Kemnitz","year":"1998","unstructured":"Kemnitz, A., Kolberg, H.: Coloring of integer distance graphs. Discrete Math. 191, 113\u2013123 (1998)","journal-title":"Discrete Math."},{"key":"22_CR14","first-page":"851","volume":"12","author":"D Liu","year":"2008","unstructured":"Liu, D.: From rainbow to the lonely runner: a survey on coloring parameters of distance graphs. Taiwanese J. Math. 12, 851\u2013871 (2008)","journal-title":"Taiwanese J. Math."},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1007\/s10878-012-9509-4","volume":"25","author":"D Liu","year":"2013","unstructured":"Liu, D., Sutedja, A.: Chromatic number of distance graphs generated by the sets $$\\{2, 3, x, y\\}$$. J. Comb. Optim. 25, 680\u2013693 (2013)","journal-title":"J. Comb. Optim."},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1002\/jgt.20020","volume":"47","author":"D Liu","year":"2004","unstructured":"Liu, D., Zhu, X.: Fractional chromatic number and circular chromatic number for distance graphs with large clique size. J. Graph Theory 47, 129\u2013146 (2004)","journal-title":"J. Graph Theory"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1137\/0606050","volume":"6","author":"J Rabinowitz","year":"1985","unstructured":"Rabinowitz, J., Proulx, V.: An asymptotic approach to the channel assignment problem. SIAM J. Alg. Discrete Methods 6, 507\u2013518 (1985)","journal-title":"SIAM J. Alg. Discrete Methods"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0166-218X(94)90109-0","volume":"51","author":"M Voigt","year":"1994","unstructured":"Voigt, M., Walther, H.: Chromatic number of prime distance graphs. Discrete Appl. Math. 51, 197\u2013209 (1994)","journal-title":"Discrete Appl. Math."},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/0012-365X(91)90454-A","volume":"97","author":"M Voigt","year":"1991","unstructured":"Voigt, M., Walther, H.: On the chromatic number of special distance graphs. Discrete Math. 97, 395\u2013397 (1991)","journal-title":"Discrete Math."},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01298332","volume":"71","author":"J Wills","year":"1967","unstructured":"Wills, J.: Zwei S\u00e4tze \u00fcber inhomogene diophantische appromixation von irrationlzahlen. Monatsch. Math. 71, 263\u2013269 (1967)","journal-title":"Monatsch. Math."},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0012-365X(00)00217-X","volume":"229","author":"X Zhu","year":"2001","unstructured":"Zhu, X.: Circular chromatic number: a survey. Discrete Math. 229, 371\u2013410 (2001)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19315-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T17:19:23Z","timestamp":1675271963000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19315-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319193144","9783319193151"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19315-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"7 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}