Publications of M. Molloy

1. M. Molloy and B. Reed. Graph colouring and the probabilistic method, volume 23 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 2002. [bibtex-entry]

1. B. Farzad, M. Molloy, and B. Reed. $(\Delta-k)$-critical graphs. J. Combin. Theory Ser. B, 93(2):173--185, 2005. [bibtex-entry]


2. M. Molloy and B. Reed. Graph colouring via the probabilistic method. In Graph theory and combinatorial biology (Balatonlelle, 1996), volume 7 of Bolyai Soc. Math. Stud., pages 125--155. János Bolyai Math. Soc., Budapest, 1999. [bibtex-entry]


3. M. Molloy, B. Reed, and William Steiger. On the mixing rate of the triangulation walk. In Randomization methods in algorithm design (Princeton, NJ, 1997), volume 43 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 179--190. Amer. Math. Soc., Providence, RI, 1999. [bibtex-entry]


4. Hugh Hind, M. Molloy, and B. Reed. Total coloring with $\Delta+{\rm poly}(\log\Delta)$ colors. SIAM J. Comput., 28(3):816--821 (electronic), 1999. [bibtex-entry]


5. M. Molloy and B. Reed. Critical subgraphs of a random graph. Electron. J. Combin., 6:Research Paper 35, 13 pp. (electronic), 1999. [bibtex-entry]


6. M. Molloy and B. Reed. A bound on the total chromatic number. Combinatorica, 18(2):241--280, 1998. [bibtex-entry]


7. M. Molloy and B. Reed. The size of the giant component of a random graph with a given degree sequence. Combin. Probab. Comput., 7(3):295--305, 1998. [bibtex-entry]


8. H. Hind, M. Molloy, and B. Reed. Colouring a graph frugally. Combinatorica, 17(4):469--482, 1997. [bibtex-entry]


9. M. Molloy and B. Reed. A bound on the strong chromatic index of a graph. J. Combin. Theory Ser. B, 69(2):103--109, 1997. [bibtex-entry]


10. C. Cooper, A. Frieze, M. Molloy, and B. Reed. Perfect matchings in random $r$-regular, $s$-uniform hypergraphs. Combin. Probab. Comput., 5(1):1--14, 1996. [bibtex-entry]


11. M. Molloy and B. Reed. The dominating number of a random cubic graph. Random Structures Algorithms, 7(3):209--221, 1995. [bibtex-entry]

1. M. Molloy and B. A. Reed. Asymptotically optimal frugal colouring. In Proceedings of Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 106-114, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


2. M. Molloy and B. Reed. Colouring graphs when the number of colours is nearly the maximum degree. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, New York, pages 462--470 (electronic), 2001. ACM. [bibtex-entry]


3. M. Molloy and B. Reed. $k$-colouring when $k$ is close to $\Delta$. In 6th International Conference on Graph Theory (Marseille, 2000), volume 5 of Electron. Notes Discrete Math., Amsterdam, pages 4 pp. (electronic), 2000. Elsevier. [bibtex-entry]


4. M. Molloy and B. Reed. Near-optimal list colorings. In Proceedings of the Ninth International Conference ``Random Structures and Algorithms'' (Poznan, 1999), volume 17, pages 376--402, 2000. [bibtex-entry]


5. M. Molloy and B. Reed. Further algorithmic aspects of the local lemma. In STOC '98 (Dallas, TX), New York, pages 524--529, 1999. ACM. [bibtex-entry]


6. M. Molloy and B. Reed. Colouring graphs where chromatic number is almost their maximum degree. In LATIN'98: theoretical informatics (Campinas, 1998), volume 1380 of Lecture Notes in Comput. Sci., Berlin, pages 216--225, 1998. Springer. [bibtex-entry]


7. M. Molloy and B. Reed. A critical point for random graphs with a given degree sequence. In Proceedings of the Sixth International Seminar on Random Graphs and Probabilistic Methods in Combinatorics and Computer Science, ``Random Graphs '93'' (Poznan, 1993), volume 6, pages 161--179, 1995. [bibtex-entry]

This document was translated from BibT_EX by bibtex2html