A Fast Parallel Algorithm for Optimal Edge-Colouring of Outerplanar Graphs

We prove that every outerplanar graph can be optimally edge-coloured in polylog time using a polynomial number of processors on a parallel random access machine without write conflicts (P-RAM).