Abstract:
We give extremely simple and fast randomized ditributed
algorithms for computing vertex colourings in triangle-free graphs which use
many fewer than 
colours, where denotes the maximum degree
of the input network
Available as PostScript, PDF, DVI.