Near-optimal list colorings
Authors:
- 1 October 2000
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 17 (3-4) , 376-402
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Asymptotically Good List-ColoringsJournal of Combinatorial Theory, Series A, 1996
- The strong chromatic number of a graphRandom Structures & Algorithms, 1992
- A parallel algorithmic version of the local lemmaRandom Structures & Algorithms, 1991
- An algorithmic approach to the Lovász local lemma. IRandom Structures & Algorithms, 1991
- Asymptotic behavior of the chromatic index for hypergraphsJournal of Combinatorial Theory, Series A, 1989
- On a Packing and Covering ProblemEuropean Journal of Combinatorics, 1985
- A Dense Infinite Sidon SequenceEuropean Journal of Combinatorics, 1981
- SOME UNSOLVED PROBLEMS IN GRAPH THEORYRussian Mathematical Surveys, 1968
- Weighted sums of certain dependent random variablesTohoku Mathematical Journal, 1967
- On colouring the nodes of a networkMathematical Proceedings of the Cambridge Philosophical Society, 1941