{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T02:11:04Z","timestamp":1761963064212,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228943"},{"type":"electronic","value":"9783540278214"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27821-4_20","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T18:54:06Z","timestamp":1284490446000},"page":"219-228","source":"Crossref","is-referenced-by-count":13,"title":["The Chromatic Number of Random Regular Graphs"],"prefix":"10.1007","author":[{"given":"Dimitris","family":"Achlioptas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristopher","family":"Moore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"20_CR1","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S0022-0000(03)00120-X","volume":"67","author":"D. Achlioptas","year":"2003","unstructured":"Achlioptas, D., Moore, C.: Almost all graphs of degree 4 are 3-colorable. Journal of Computer and System Sciences\u00a067(4), 441\u2013471 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Achlioptas, D., Moore, C.: The asymptotic order of the k-SAT threshold. In: Proc. 43rd Foundations of Computer Science, pp. 779\u2013788 (2002)","DOI":"10.1109\/SFCS.2002.1182003"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/3-540-45726-7_7","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"D. Achlioptas","year":"2002","unstructured":"Achlioptas, D., Moore, C.: On the two-colorability of random hypergraphs. In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol.\u00a02483, pp. 78\u201390. Springer, Heidelberg (2002)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Achlioptas, D., Naor, A.: The two possible values of the chromatic number of a random graph. In: Proc. 36th Symp. on the Theory of Computing (2004)","DOI":"10.1145\/1007352.1007442"},{"key":"20_CR5","volume-title":"Random graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"Bollob\u00e1s, B.: Random graphs. Academic Press, London (1985)"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0095-8956(92)90070-E","volume":"54","author":"A. Frieze","year":"1992","unstructured":"Frieze, A., Luczak, T.: On the independence and chromatic numbers of random regular graphs. J. Combin. Theory Ser. B\u00a054, 123\u2013132 (1992)","journal-title":"J. Combin. Theory Ser. B"},{"key":"20_CR7","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., Lucza, T., Ruci\u0144ski, A.: Random Graphs. Wiley & Sons, Chichester (2000)"},{"key":"20_CR8","unstructured":"Krza\u0327ka_la, F., Pagnani, A., Weigt, M.: Threshold values, stability analysis and high-q asymptotics for the coloring problem on random graphs. Preprint, cond-mat\/0403725. Physical Review (to appear)"},{"issue":"1","key":"20_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01375472","volume":"11","author":"T. Luczak","year":"1991","unstructured":"Luczak, T.: The chromatic number of random graphs. Combinatorica\u00a011(1), 45\u201354 (1991)","journal-title":"Combinatorica"},{"issue":"3","key":"20_CR10","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01205080","volume":"11","author":"T. Luczak","year":"1991","unstructured":"Luczak, T.: A note on the sharp concentration of the chromatic number of random graphs. Combinatorica\u00a011(3), 295\u2013297 (1991)","journal-title":"Combinatorica"},{"key":"20_CR11","unstructured":"Molloy, M.: The Chromatic Number of Sparse Random Graphs. Master\u2019s thesis, Faculty of Mathematics, University of Waterloo (1992)"},{"key":"20_CR12","series-title":"Mathematical Society Lecture Note Series","first-page":"239","volume-title":"Surveys in Combinatorics.","author":"N.C. Wormald","year":"1999","unstructured":"Wormald, N.C.: Models of random regular graphs. In: Lamb, J.D., Preece, D.A. (eds.) Surveys in Combinatorics., London Mathematical Society Lecture Note Series, vol.\u00a0276, pp. 239\u2013298. Cambridge University Press, Cambridge (1999)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27821-4_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T20:41:06Z","timestamp":1740516066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27821-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228943","9783540278214"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27821-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}