Colouring graphs when the number of colours is nearly the maximum degree

Michael Molloy, Bruce A. Reed. Colouring graphs when the number of colours is nearly the maximum degree. In STOC. pages 462-470, 2001. [doi]

@inproceedings{MolloyR01,
  title = {Colouring graphs when the number of colours is nearly the maximum degree},
  author = {Michael Molloy and Bruce A. Reed},
  year = {2001},
  doi = {10.1145/380752.380840},
  url = {http://doi.acm.org/10.1145/380752.380840},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/MolloyR01},
  cites = {0},
  citedby = {0},
  pages = {462-470},
  booktitle = {STOC},
}