Prof. Colin McDiarmid

Random cubic planar graphs, Random Structures and Algorithms 30 (2007) 78 -- 94. (Joint with Manuel Bodirsky, Mihyun Kang and Mike Loeffler.)

Random planar graphs with given average degree, in Combinatorics, Complexity and Chance, a tribute to Dominic Welsh (G. Grimmett and C. McDiarmid eds) Oxford University Press, 2007, 83 -- 102.  (Joint with Stefanie Gerke, Angelika Steger and Andreas Weissl.)

Asymptotic distributions and chaos for the supermarket model, Electronic Journal of Probability 12 (2007) 75 -- 99.  (Joint with Malwina Luczak.)

Vertex-Colouring Edge-Weightings, Combinatorica 27 (1) (2007) 1 -- 12. (Joint with L.Addario-Berry, K.Dalal, B.A.Reed and A.Thomason.)

On the span of a random channel assignment problem, Combinatorica 27 (2007) 183 -- 203.

List colouring squares of planar graphs.
Electronic Notes in Discrete Mathematics 29 (2007) 515 -- 519. (Joint with Frederic Havet, Jan van den Heuvel and Bruce Reed.)

The t-improper chromatic number of random graphs.
Electronic Notes in Discrete Mathematics 29 (2007) 411 -- 417. (Joint with Ross Kang.)

Random graphs on surfaces, J. Combinatorial Theory B 98 (2008) 778 -- 797.

On the maximum degree of a random planar graph, Combinatorics, Probability and Computing 17 (2008) 591-- 601.  (Joint with Bruce Reed.)

Random graphs from a minor-closed class, Combinatorics, Probability and Computing 18 (2009) 583-599.