{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:30:09Z","timestamp":1648924209731},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11155,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1983,1]]},"DOI":"10.1016\/0166-218x(83)90022-7","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:17:01Z","timestamp":1034090221000},"page":"123-132","source":"Crossref","is-referenced-by-count":3,"title":["On the chromatic forcing number of a random graph"],"prefix":"10.1016","volume":"5","author":[{"given":"Colin","family":"McDiarmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(83)90022-7_BIB1","series-title":"Proc. 9th Ann. ACM Symp. Theory Comput.","first-page":"30","article-title":"Fast probabilistic algorithms for Hamiltonian circuits and matchings","author":"Angluin","year":"1977"},{"key":"10.1016\/0166-218X(83)90022-7_BIB2","article-title":"Graph Theory","volume":"63","author":"Bollob\u00e1s","year":"1979"},{"key":"10.1016\/0166-218X(83)90022-7_BIB3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/jgt.3190060209","article-title":"Vertices of given degree in a random graph","volume":"6","author":"Bollob\u00e1s","year":"1982","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(83)90022-7_BIB4","series-title":"Graph Theory with Applications","author":"Bondy","year":"1977"},{"key":"10.1016\/0166-218X(83)90022-7_BIB5","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0012-365X(79)90084-0","article-title":"The tail of the hypergeometric distribution","volume":"25","author":"Chv\u00e1tal","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(83)90022-7_BIB6","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1137\/0202026","article-title":"An algorithm for determining the chromatic number of a graph","volume":"2","author":"Corneil","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(83)90022-7_BIB7","author":"Cornuejols","year":"1979","journal-title":"Degree sequences of random graphs"},{"key":"10.1016\/0166-218X(83)90022-7_BIB8","series-title":"Probabilistic Methods in Combinatorics","author":"Erd\u00f6s","year":"1974"},{"issue":"B","key":"10.1016\/0166-218X(83)90022-7_BIB9","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0095-8956(77)90039-9","article-title":"On the chromatic index of almost all graphs","volume":"23","author":"Erd\u00f6s","year":"1977","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0166-218X(83)90022-7_BIB10","series-title":"Edge-colourings of graphs","author":"Fiorini","year":"1977"},{"key":"10.1016\/0166-218X(83)90022-7_BIB11","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(83)90022-7_BIB12","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1017\/S0305004100051124","article-title":"On colouring random graphs","volume":"77","author":"Grimmett","year":"1975","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"10.1016\/0166-218X(83)90022-7_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0208001","article-title":"Determining the chromatic number of a graph","volume":"8","author":"McDiarmid","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(83)90022-7_BIB14","first-page":"76","article-title":"Colouring random graphs badly","volume":"34","author":"McDiarmid","year":"1977"},{"key":"10.1016\/0166-218X(83)90022-7_BIB15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1017\/S0305004100059648","article-title":"Achromatic numbers of random graphs","volume":"92","author":"McDiarmid","year":"1982","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"10.1016\/0166-218X(83)90022-7_BIB16","unstructured":"C. McDiarmid, Canonical colourings of random graphs, in preparation."},{"key":"10.1016\/0166-218X(83)90022-7_BIB17","first-page":"9","article-title":"Critical graphs with a given chromatic class (Russian)","volume":"5","author":"Vizing","year":"1965","journal-title":"Diskret. Analiz."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X83900227?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X83900227?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T12:29:55Z","timestamp":1554812995000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X83900227"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,1]]}},"alternative-id":["0166218X83900227"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(83)90022-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1983,1]]}}}