{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:18:04Z","timestamp":1775837884808,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1987,9,1]],"date-time":"1987-09-01T00:00:00Z","timestamp":557452800000},"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":[[1987,9]]},"DOI":"10.1007\/bf02579304","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T18:20:25Z","timestamp":1174587625000},"page":"275-284","source":"Crossref","is-referenced-by-count":26,"title":["Expose-and-merge exploration and the chromatic number of a random graph"],"prefix":"10.1007","volume":"7","author":[{"given":"D. W.","family":"Matula","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579304_CR1","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1017\/S0305004100053056","volume":"80","author":"B. Bollob\u00e1s","year":"1976","unstructured":"B. Bollob\u00e1s andP. Erd\u0151s, Cliques in random graphs,Math. Proc. Camb. Phil. Soc. 80, (1976), 419\u2013427.","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"BF02579304_CR2","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"B. Bollob\u00e1s,Random Graphs, Academic Press, London, 1985."},{"key":"BF02579304_CR3","volume-title":"Probabilistic Methods in Combinatorics","author":"P. Erd\u0151s","year":"1974","unstructured":"P. Erd\u0151s andT. Spencer,Probabilistic Methods in Combinatorics, Academic Press, New York, 1974."},{"key":"BF02579304_CR4","volume-title":"An Introduction to Probability Theory and its Applications","author":"W. Feller","year":"1968","unstructured":"W. Feller,An Introduction to Probability Theory and its Applications, 3rd Ed., Wiley, New York, 1968.","edition":"3rd Ed."},{"key":"BF02579304_CR5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1017\/S0305004100051124","volume":"77","author":"G. R. Grimmett","year":"1975","unstructured":"G. R. Grimmett andC. J. H. McDiarmid, On coloring random graphs,Math. Proc. Camb. Phil. Soc. 77, (1975), 313\u2013324.","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"BF02579304_CR6","series-title":"Tech. Rep.","volume-title":"Probabilistic bounds and heuristic algorithms for coloring large random graphs","author":"A. Johri","year":"1982","unstructured":"A. Johri andD. W. Matula, Probabilistic bounds and heuristic algorithms for coloring large random graphs,Tech. Rep. 82-CSE-6, Southern Meth. Univ., Dallas, (1982)."},{"key":"BF02579304_CR7","first-page":"14","volume":"35","author":"A. D. Korshunov","year":"1980","unstructured":"A. D. Korshunov, The chromatic number ofn-vertex graphs,Metody Diskret. Analiz. No. 35 (1980), 14\u201344 (in Russian).","journal-title":"Metody Diskret. Analiz. No."},{"key":"BF02579304_CR8","unstructured":"D. W. Matula, The employee party problem,Not. A. M. S. 19, (1972), A-382."},{"key":"BF02579304_CR9","series-title":"Tech. Rep.","volume-title":"The largest clique size in a random graph","author":"D. W. Matula","year":"1976","unstructured":"D. W. Matula, The largest clique size in a random graph,Tech. Rep. CS7608, Southern Meth. Univ., Dallas, (1976)."},{"key":"BF02579304_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/B978-1-4832-3187-7.50015-5","volume-title":"Graph Theory and Computing","author":"D. W. Matula","year":"1972","unstructured":"D. W. Matula, G. Marble andJ. D. Isaacson, Graph Coloring Algorithms, inGraph Theory and Computing, Read, R. C., ed., Academic Press, New York, 1972, 109\u2013122."},{"key":"BF02579304_CR11","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01874388","volume":"1","author":"C. J. H. McDiarmid","year":"1984","unstructured":"C. J. H. McDiarmid, Colouring random graphs,Ann. Op. Res. 1, (1984), 183\u2013200.","journal-title":"Ann. Op. Res."},{"key":"BF02579304_CR12","volume-title":"Graphical Evolution \u2014 An Introduction to the Theory of Random Graphs","author":"E. M. Palmer","year":"1985","unstructured":"E. M. Palmer,Graphical Evolution \u2014 An Introduction to the Theory of Random Graphs, Wiely Interscience, New York, 1985."},{"key":"BF02579304_CR13","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02579208","volume":"7","author":"E. Shamir","year":"1987","unstructured":"E. Shamir andJ. Spencer, Sharp Concentration of the Chromatic Number on Random GraphsG n,p ,Combinatorica 7 (1987), 121\u2013129.","journal-title":"Combinatorica"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579304.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579304\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579304","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T12:45:01Z","timestamp":1558183501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,9]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,9]]}},"alternative-id":["BF02579304"],"URL":"https:\/\/doi.org\/10.1007\/bf02579304","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,9]]}}}