{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T03:07:17Z","timestamp":1761966437014,"version":"build-2065373602"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,11,1]],"date-time":"2011-11-01T00:00:00Z","timestamp":1320105600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s00493-011-2403-3","type":"journal-article","created":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T16:46:09Z","timestamp":1321461969000},"page":"423-488","source":"Crossref","is-referenced-by-count":18,"title":["On the chromatic number of random geometric graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Colin","family":"Mcdiarmid","sequence":"first","affiliation":[]},{"given":"Tobias","family":"M\u00fcller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,11,16]]},"reference":[{"key":"2403_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random graphs, volume 73 of Cambridge Studies in Advanced Mathematics","author":"B. Bollob\u00e1s","year":"2001","unstructured":"B. Bollob\u00e1s, Random graphs, volume 73 of Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge, second edition, 2001.","edition":"second edition"},{"key":"2403_CR2","volume-title":"Linear Programming","author":"V. Chv\u00e1tal","year":"1983","unstructured":"V. Chv\u00e1tal: Linear Programming, W. H. Freedman and Company, New York, 1983."},{"issue":"1\u20133","key":"2403_CR3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B. N. Clark","year":"1990","unstructured":"B. N. Clark, C. J. Colbourn and D. S. Johnson: Unit disk graphs. Discrete Math. 86(1\u20133) (1990), 165\u2013177.","journal-title":"Discrete Math"},{"key":"2403_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3460-7","volume-title":"Scan Statistics","author":"J. Glaz","year":"2001","unstructured":"J. Glaz, J. Naus and S. Wallenstein: Scan Statistics, Springer, New York, 2001."},{"issue":"3","key":"2403_CR5","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/PL00009196","volume":"20","author":"A. Gr\u00e4f","year":"1998","unstructured":"A. Gr\u00e4f, M. Stumpf and G. Wei\u00dfenfels: On coloring unit disk graphs. Algorithmica 20(3) (1998), 277\u2013293.","journal-title":"Algorithmica"},{"key":"2403_CR6","volume-title":"Handbook of Convex Geometry","author":"P. M. Gruber","year":"1993","unstructured":"P. M. Gruber and J. M. Wills: Handbook of Convex Geometry, North-Holland, Amsterdam, 1993."},{"key":"2403_CR7","volume-title":"Poisson Processes","author":"J. Kingman","year":"1993","unstructured":"J. Kingman: Poisson Processes, Oxford University Press, Oxford, 1993."},{"issue":"1","key":"2403_CR8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01375472","volume":"11","author":"T. \u0141uczak","year":"1991","unstructured":"T. \u0141uczak: The chromatic number of random graphs, Combinatorica 11(1) (1991), 45\u201354.","journal-title":"Combinatorica"},{"issue":"2","key":"2403_CR9","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1093\/biomet\/55.2.422","volume":"55","author":"C. L. Mallows","year":"1968","unstructured":"C. L. Mallows: An inequality involving multinomial probabilities. Biometrika 55(2) (1968), 422\u2013424.","journal-title":"Biometrika"},{"key":"2403_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry, volume 212 of Graduate Texts in Mathematics","author":"J. Matou\u0161ek","year":"2002","unstructured":"J. Matou\u0161ek: Lectures on Discrete Geometry, volume 212 of Graduate Texts in Mathematics, Springer-Verlag, New York, 2002."},{"issue":"2","key":"2403_CR11","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/rsa.10077","volume":"22","author":"C. J. H. McDiarmid","year":"2003","unstructured":"C. J. H. McDiarmid: Random channel assignment in the plane, Random Structures and Algorithms 22(2) (2003), 187\u2013212.","journal-title":"Random Structures and Algorithms"},{"issue":"5","key":"2403_CR12","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s00493-008-2283-3","volume":"28","author":"T. M\u00fcller","year":"2008","unstructured":"T. M\u00fcller: Two-point concentration in random geometric graphs. Combinatorica 28(5) (2008), 529\u2013545.","journal-title":"Combinatorica"},{"key":"2403_CR13","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033203","volume-title":"Combinatorial Geometry","author":"J. Pach","year":"1995","unstructured":"J. Pach and P. K. Agarwal: Combinatorial Geometry, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons Inc., New York, 1995. A Wiley-Interscience Publication."},{"unstructured":"R. Peeters: On coloring j-unit sphere graphs. Technical Report FEW 512, Economics Department, Tilburg University, 1991.","key":"2403_CR14"},{"key":"2403_CR15","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random Geometric Graphs","author":"M. D. Penrose","year":"2003","unstructured":"M. D. Penrose: Random Geometric Graphs, Oxford University Press, Oxford, 2003."},{"issue":"1","key":"2403_CR16","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/S0196-6774(03)00048-8","volume":"48","author":"V. Raghavan","year":"2003","unstructured":"V. Raghavan and J. Spinrad: Robust algorithms for restricted domains, J. Algorithms 48(1) (2003), 160\u2013172. Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (Washington, DC, 2001).","journal-title":"J. Algorithms"},{"key":"2403_CR17","series-title":"Cambridge Tracts in Mathematics and Mathematical Physics","volume-title":"Packing and Covering","author":"C. A. Rogers","year":"1964","unstructured":"C. A. Rogers: Packing and Covering, Cambridge Tracts in Mathematics and Mathematical Physics, No. 54. Cambridge University Press, New York, 1964."},{"key":"2403_CR18","volume-title":"Fractional Graph Theory","author":"E. R. Scheinerman","year":"1997","unstructured":"E. R. Scheinerman and D. H. Ullman: Fractional Graph Theory, Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons Inc., New York, 1997."},{"key":"2403_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511987045","volume-title":"A Course in Combinatorics","author":"J. H. Lint van","year":"2001","unstructured":"J. H. van Lint and R. M. Wilson: A Course in Combinatorics, Cambridge University Press, Cambridge, second edition, 2001.","edition":"second edition"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-011-2403-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-011-2403-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-011-2403-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:47Z","timestamp":1559093567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-011-2403-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["2403"],"URL":"https:\/\/doi.org\/10.1007\/s00493-011-2403-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"type":"print","value":"0209-9683"},{"type":"electronic","value":"1439-6912"}],"subject":[],"published":{"date-parts":[[2011,11]]}}}