A unified approach to distance-two colouring of planar graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
An optimal square coloring of planar graphs
Journal of Combinatorial Optimization
Sufficient sparseness conditions for G2 to be (Δ+1)-choosable, when Δ≥5
Discrete Applied Mathematics
Towards an on-line version of Ohba's conjecture
European Journal of Combinatorics
Hi-index | 0.05 |