Asymptotically the list colouring constants are 1
Journal of Combinatorial Theory Series B
Combinatorics, Probability and Computing
Independent transversals in locally sparse graphs
Journal of Combinatorial Theory Series B
On the strong chromatic number of random graphs
Combinatorics, Probability and Computing
An asymptotically tight bound on the adaptable chromatic number
Journal of Graph Theory
Fast distributed coloring algorithms for triangle-free graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
We present a conjecture concerning list colourings and prove a weakened form of it. © 1999 John Wiley & Sons, Inc. J Graph Theory 31: 149–153, 1999