✦ LIBER ✦

Graph Colouring and the Probabilistic Methodby Michael Molloy; Bruce Reed

✍ Scribed by Review by: Noga Alon

Book ID: 124946171
Publisher: Society for Industrial and Applied Mathematics
Year: 2003
Tongue: English
Weight: 357 KB
Volume: 45
Category: Article
ISSN: 0036-1445
DOI: 10.2307/25054375

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graph Colouring and the Probabilistic Me

Graph Colouring and the Probabilistic Method

✍ Michael Molloy, Bruce Reed (auth.) 📂 Library 📅 2002 🏛 Springer 🌐 English ⚖ 3 MB

Over the past decade, many major advances have been made in the field of graph colouring via the probabilistic method. This monograph provides an accessible and unified treatment of these results, using tools such as the Lovasz Local Lemma and Talagrand's concentration inequality.The topics covered

Colouring a graph frugally

✍ Hugh Hind; Michael Molloy; Bruce Reed 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 643 KB

A Bound on the Strong Chromatic Index of

A Bound on the Strong Chromatic Index of a Graph

✍ Michael Molloy; Bruce Reed 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 695 KB

We show that the strong chromatic index of a graph with maximum degree 2 is at most (2&=) 2 2 , for some =>0. This answers a question of Erdo s and Nes etr il. 1997 Academic Press ## 1. Introduction A strong edge-colouring of a (simple) graph, G, is a proper edge-colouring of G with the added res