STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Colouring graphs when the number of colours is nearly the maximum degree
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Three-colourbility and forbidden subgraphs. II: polynomial algorithms
Discrete Mathematics
Wireless Personal Communications: An International Journal
The Chromatic Number of Graph Powers
Combinatorics, Probability and Computing
Random Structures & Algorithms
Journal of Combinatorial Theory Series B
An upper bound for the chromatic number of line graphs
European Journal of Combinatorics
Asymptotically optimal frugal colouring
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Asymptotically optimal frugal colouring
Journal of Combinatorial Theory Series B
Survey: Randomly colouring graphs (a combinatorial view)
Computer Science Review
| Hi-index | 0.00 |
We discuss bounding the chromatic number of a graph by a convex combination of its clique number and its maximum degree plus 1. We will often have recourse to the probabilistic method. © 1998 John Wiley & Sons, Inc. J Graph Theory 27: 177–212, 1998