17 citations · 57 across the 36 of their papers we have counts for
1 paper · 2 filters
Gal Kronenberg, Shoham Letzter, Alexey Pokrovskiy +1
A common problem in graph colouring seeks to decompose the edge set of a given graph into few similar and simple subgraphs, under certain divisibility conditions. In 1987 Wormald c…