Anthony Bonato, Graeme Kemkes, and Pawel Pralat, Almost all cop-win graphs contain a universal vertex, submitted.
Anthony Bonato, Jason Brown, Graeme Kemkes, and Pawel Pralat, Independence and chromatic densities of graph, submitted.
Graeme Kemkes and Nicholas Wormald, An improved upper bound on the length of the longest cycle of a supercritical random graph, submitted.
Graeme Kemkes, Xavier Pérez-Giménez and Nicholas Wormald (2010), On the chromatic number of random d-regular graphs, Advances in Mathematics, Volume 223, Issue 1: 300-328.
J. Díaz, A. C. Kaporis, G. D. Kemkes, L. M. Kirousis, X. Pérez and N. Wormald (2009), On the chromatic number of a random 5-regular graph, Journal of Graph Theory, Volume 61, Issue 3: 157-191.
G. Kemkes, D. Merlini and B. Richmond (2008), Maximum Stirling numbers of the second kind, Integers 8(1), #A27, 17 pages.
G. Kemkes, C.F. Lee, D. Merlini and B. Richmond (2003), Stirling numbers for complex arguments: asymptotics and identities, SIAM Journal on Discrete Mathematics, Volume 16, Number 2: 179-191.