On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$
Combinatorics, Probability and Computing
An upper bound for the chromatic number of line graphs
European Journal of Combinatorics
A unified approach to distance-two colouring of planar graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Asymptotically optimal frugal colouring
Journal of Combinatorial Theory Series B
The Local Nature of List Colorings for Graphs of High Girth
SIAM Journal on Computing
Survey: Randomly colouring graphs (a combinatorial view)
Computer Science Review
Hi-index | 0.00 |