Near-optimal, distributed edge colouring via the nibble method

The NP-Completeness of Edge-Coloring

Ian Holyer · SIAM Journal on Computing · 1981 · 1.1K citations

Natural Sciences, Visualization, Color Theory +10

On a Packing and Covering Problem

Vojtěch Rödl · European Journal of Combinatorics · 1985 · 414 citations

Natural Sciences, Computer Science, Mathematics +8

The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i>²/log <i>t</i>

Jeong Han Kim · Random Structures and Algorithms · 1995 · 333 citations

Natural Sciences, Mathematics, Color Theory +11

Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds

Alessandro Panconesi, Aravind Srinivasan · SIAM Journal on Computing · 1997 · 274 citations

Natural Sciences, Computer Science, Algorithms +14

Surveys in combinatorics 1987

Discrete Mathematics · 1989 · 209 citations

Natural Sciences, Mathematics, Combinatorics +10