{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:27Z","timestamp":1720640847359},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s1571-0653(05)80173-8","type":"journal-article","created":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T11:08:52Z","timestamp":1114945732000},"page":"235-238","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["k-Colouring when k is close to \u0394"],"prefix":"10.1016","volume":"5","author":[{"given":"Michael","family":"Molloy","sequence":"first","affiliation":[]},{"given":"Bruce","family":"Reed","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80173-8_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0195-6698(81)80014-5","article-title":"A dense infinite Sidon sequence","volume":"2","author":"Ajtai","year":"1981","journal-title":"Eur. J. Comb."},{"key":"10.1016\/S1571-0653(05)80173-8_BIB2","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1002\/rsa.3240020403","article-title":"A parallel algorithmic version of the Local Lemma","volume":"2","author":"Alon","year":"1991","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/S1571-0653(05)80173-8_BIB3","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/rsa.3240020402","article-title":"An algorithmic approach to the Lov\u00e1sz Local Lemma","volume":"2","author":"Beck","year":"1991","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/S1571-0653(05)80173-8_BIB4","doi-asserted-by":"crossref","DOI":"10.1145\/335305.335310","article-title":"An Algorithmic Approach to the General Lovsz Local Lemma with Applications to Scheduling and Satisfiability Problems","author":"Czumaj","year":"2000","journal-title":"Proceedings of STOC"},{"key":"10.1016\/S1571-0653(05)80173-8_BIB5","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1017\/S0963548398003678","article-title":"Uniquely colourable graphs and the hardness of colouring graphs with large girth.","volume":"7","author":"Emden-Weinert","year":"1998","journal-title":"Combinatorics, Probability and Computing"},{"key":"10.1016\/S1571-0653(05)80173-8_BIB6","first-page":"91","article-title":"Asymptotic choice number for triangle free graphs","author":"Johansson","year":"1996","journal-title":"DIMACS Technical Report"},{"key":"10.1016\/S1571-0653(05)80173-8_BIB7","unstructured":"A. Johansson, The choice number of sparse graphs, manuscript."},{"key":"10.1016\/S1571-0653(05)80173-8_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jcta.1996.0001","article-title":"Asymptotically good list-colorings","volume":"73","author":"Kahn","year":"1996","journal-title":"J. Combinatorial Th. (A)"},{"key":"10.1016\/S1571-0653(05)80173-8_BIB9","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1006\/jctb.1996.0067","article-title":"Asymptotics of the chromatic index for multigraphs","volume":"68","author":"Kahn","year":"1996","journal-title":"J. Combinatorial Th. (B)"},{"key":"10.1016\/S1571-0653(05)80173-8_BIB10","unstructured":"J. Kahn, Asymptotics of the list-chromatic index for multigraphs, manuscript."},{"key":"10.1016\/S1571-0653(05)80173-8_BIB11","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1017\/S0963548300001528","article-title":"On Brooks' Theorem for sparse graphs","volume":"4","author":"Kim","year":"1995","journal-title":"Combinatorics, Probability and Computing"},{"key":"10.1016\/S1571-0653(05)80173-8_BIB12","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0012-365X(97)89267-9","article-title":"On the NP-completeness of the k-colour-ability problem for triangle-free graphs","volume":"162","author":"Maffray","year":"1996","journal-title":"Disc. Math."},{"key":"10.1016\/S1571-0653(05)80173-8_BIB13","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1006\/jctb.1997.1724","article-title":"A bound on the strong chromatic index of a graph","volume":"69","author":"Molloy","year":"1997","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"10.1016\/S1571-0653(05)80173-8_BIB14","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/PL00009820","article-title":"A bound on the total chromatic number","volume":"18","author":"Molloy","year":"1998","journal-title":"Combinatorica"},{"key":"10.1016\/S1571-0653(05)80173-8_BIB15","unstructured":"M. Molloy and B. Reed, Near-optimal list colourings, submitted."},{"key":"10.1016\/S1571-0653(05)80173-8_BIB16","first-page":"524","article-title":"An algorithmic version of the Lovasz Local Lemma","author":"Molloy","year":"1998","journal-title":"proceedings of STOC"},{"key":"10.1016\/S1571-0653(05)80173-8_BIB17","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0054323","article-title":"Colouring graphs whose chromatic number is near their maximum degree","author":"Molloy","year":"1998","journal-title":"proceedings of Latin American Theoretical Informatics"},{"key":"10.1016\/S1571-0653(05)80173-8_BIB18","series-title":"J. Bolyai Math. Soc.","first-page":"125","article-title":"Graph Colouring via the Probabilistic Method, in Graph Theory and Computational Biology","author":"Molloy","year":"1999"},{"key":"10.1016\/S1571-0653(05)80173-8_BIB19","unstructured":"M. Molloy and B. Reed, Graph colouring and the probabilistic method, a book in preparation."},{"key":"10.1016\/S1571-0653(05)80173-8_BIB20","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/(SICI)1097-0118(199804)27:4<177::AID-JGT1>3.0.CO;2-K","volume":"27","author":"Reed","year":"1998","journal-title":"\u03c7, \u0394 and \u03c9, Journal of Graph Theory"},{"key":"10.1016\/S1571-0653(05)80173-8_BIB21","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1006\/jctb.1998.1891","article-title":"A strengthening of Brooks' Theorem","volume":"76","author":"Reed","year":"1999","journal-title":"J. Comb. Th. (B)"},{"key":"10.1016\/S1571-0653(05)80173-8_BIB22","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0195-6698(85)80023-8","article-title":"On a packing and covering problem","volume":"5","author":"R\u00f6dl","year":"1985","journal-title":"Europ. J. Combinatorics"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801738?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801738?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T12:28:19Z","timestamp":1550406499000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305801738"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":22,"alternative-id":["S1571065305801738"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80173-8","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}