| A critical point for random graphs with a given degree sequence M Molloy, B Reed Random Structures & Algorithms 6 (2‐3), 161-180, 1995 | 3134 | 1995 |
| The size of the giant component of a random graph with a given degree sequence M Molloy, B Reed Combinatorics probability and computing 7 (3), 295-305, 1998 | 1108 | 1998 |
| Graph colouring and the probabilistic method M Molloy, B Reed Springer Science & Business Media, 2002 | 703 | 2002 |
| Further algorithmic aspects of the local lemma M Molloy, B Reed Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998 | 287 | 1998 |
| A bound on the chromatic number of the square of a planar graph M Molloy, MR Salavatipour Journal of Combinatorial Theory, Series B 94 (2), 189-213, 2005 | 275 | 2005 |
| A bound on the chromatic number of the square of a planar graph M Molloy, MR Salavatipour J. Combin. Theory Ser. B, 2001 | 275* | 2001 |
| Random constraint satisfaction: A more accurate picture D Achlioptas, LM Kirousis, E Kranakis, D Krizanc, MSO Molloy, ... Principles and Practice of Constraint Programming-CP97: Third International …, 1997 | 230* | 1997 |
| A bound on the strong chromatic index of a graph M Molloy, B Reed Journal of Combinatorial Theory, Series B 69 (2), 103-109, 1997 | 224 | 1997 |
| Cores in random hypergraphs and Boolean formulas M Molloy Random Structures & Algorithms 27 (1), 124-135, 2005 | 190 | 2005 |
| A bound on the total chromatic number M Molloy, B Reed Combinatorica 18 (2), 241-280, 1998 | 159 | 1998 |
| Random constraint satisfaction: a more accurate picture D Achlioptas, LM Kirousis, E Kranakis, D Krizanc, MSO Molloy, ... Random structures and algorithms 12, 253-269, 1998 | 158 | 1998 |
| Random constraint satisfaction: A more accurate picture D Achlioptas, L Kirousis, E Kranakis, D Krizanc, M Molloy, Y Stamatiou Principles and Practice of Constraint Programming-CP97, 107-120, 1997 | 158 | 1997 |
| The list chromatic number of graphs with small clique number M Molloy Journal of Combinatorial Theory, Series B 134, 264-284, 2019 | 121 | 2019 |
| The analysis of a list-coloring algorithm on a random graph D Achlioptas, M Molloy Proceedings 38th Annual Symposium on Foundations of Computer Science, 204-212, 1997 | 106 | 1997 |
| Colouring a graph frugally H Hind, M Molloy, B Reed Combinatorica 17 (4), 469-482, 1997 | 94 | 1997 |
| Frequency channel assignment on planar networks M Molloy, MR Salavatipour Algorithms—ESA 2002: 10th Annual European Symposium Rome, Italy, September …, 2002 | 85 | 2002 |
| Models and thresholds for random constraint satisfaction problems M Molloy Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 83 | 2002 |
| Models and thresholds for random constraint satisfaction problems M Molloy Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 83 | 2002 |
| Perfect matchings in random r-regular, s-uniform hypergraphs C Cooper, A Frieze, M Molloy, B Reed Combinatorics, Probability and Computing 5 (1), 1-14, 1996 | 82 | 1996 |
| The Glauber dynamics on colourings of a graph with high girth and maximum degree M Molloy Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 80 | 2002 |
Bruce ReedMcGill UniversityVerified email at cs.mcgill.ca
