{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T05:03:55Z","timestamp":1649048635830},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,10,22]],"date-time":"2009-10-22T00:00:00Z","timestamp":1256169600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s00454-009-9228-5","type":"journal-article","created":{"date-parts":[[2009,10,21]],"date-time":"2009-10-21T18:22:14Z","timestamp":1256149334000},"page":"497-502","source":"Crossref","is-referenced-by-count":3,"title":["The List-Chromatic Number of Infinite Graphs Defined on Euclidean Spaces"],"prefix":"10.1007","volume":"45","author":[{"given":"P\u00e9ter","family":"Komj\u00e1th","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,10,22]]},"reference":[{"key":"9228_CR1","first-page":"1","volume-title":"Surveys in Combinatorics, Proc. 14th British Combinatorial Conference","author":"N. Alon","year":"1993","unstructured":"Alon, N.: Restricted colorings of graphs. In: Walter, K. (ed.) Surveys in Combinatorics, Proc. 14th British Combinatorial Conference, pp.\u00a01\u201333. Cambridge University Press, Cambridge (1993)"},{"key":"9228_CR2","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/s00454-009-9190-2","volume":"42","author":"H. Ardal","year":"2009","unstructured":"Ardal, H., Man\u0306uch, J., Rosenfeld, M., Shelah, S., Stacho, L.: The odd-distance plane graph. Discrete Comput. Geom. 42, 132\u2013141 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"9228_CR3","first-page":"47","volume-title":"Proof Techniques in Graph Theory","author":"P. Erd\u0151s","year":"1969","unstructured":"Erd\u0151s, P.: Problems and results in chromatic number theory. In: Harary, F. (ed.) Proof Techniques in Graph Theory, pp.\u00a047\u201355. Academic Press, San Diego (1969)"},{"key":"9228_CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02020444","volume":"17","author":"P. Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., Hajnal, A.: On chromatic number of graphs and set systems. Acta Math. Acad. Sci. Hung. 17, 61\u201399 (1966)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"9228_CR5","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02187793","volume":"5","author":"P. Erd\u0151s","year":"1990","unstructured":"Erd\u0151s, P., Komj\u00e1th, P.: Countable decompositions of R 2 and R 3. Discrete Comput. Geom. 5, 325\u2013331 (1990)","journal-title":"Discrete Comput. Geom."},{"key":"9228_CR6","volume-title":"Graph Coloring Problems","author":"T.R. Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley, New York (1995)"},{"key":"9228_CR7","doi-asserted-by":"crossref","first-page":"921","DOI":"10.2307\/2160488","volume":"120","author":"P. Komj\u00e1th","year":"1994","unstructured":"Komj\u00e1th, P.: A decomposition theorem for R n . Proc. Am. Math. Soc. 120, 921\u2013924 (1994)","journal-title":"Proc. Am. Math. Soc."},{"key":"9228_CR8","unstructured":"Komj\u00e1th, P.: The list-chromatic number of infinite graphs. Manuscript"},{"key":"9228_CR9","volume-title":"Problems and Theorems in Classical Set Theory","author":"P. Komj\u00e1th","year":"2006","unstructured":"Komj\u00e1th, P., Totik, V.: Problems and Theorems in Classical Set Theory. Springer, Berlin (2006)"},{"key":"9228_CR10","first-page":"65","volume":"5","author":"J.H. Schmerl","year":"1995","unstructured":"Schmerl, J.H.: The list-chromatic number of Euclidean space. Geombinatorics 5, 65\u201368 (1995)","journal-title":"Geombinatorics"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-009-9228-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-009-9228-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-009-9228-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:50:31Z","timestamp":1559087431000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-009-9228-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,22]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["9228"],"URL":"https:\/\/doi.org\/10.1007\/s00454-009-9228-5","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,22]]}}}