Randomly coloring graphs with lower bounds on girth and maximum degree

Martin E. Dyer, Alan M. Frieze. Randomly coloring graphs with lower bounds on girth and maximum degree. Random Struct. Algorithms, 23(2):167-179, 2003. [doi]

@article{DyerF03,
  title = {Randomly coloring graphs with lower bounds on girth and maximum degree},
  author = {Martin E. Dyer and Alan M. Frieze},
  year = {2003},
  doi = {10.1002/rsa.10087},
  url = {http://dx.doi.org/10.1002/rsa.10087},
  tags = {graph-rewriting, e-science, rewriting},
  researchr = {https://researchr.org/publication/DyerF03},
  cites = {0},
  citedby = {0},
  journal = {Random Struct. Algorithms},
  volume = {23},
  number = {2},
  pages = {167-179},
}