Randomly Colouring Graphs with Girth Five and Large Maximum Degree

Lap Chi Lau, Michael Molloy. Randomly Colouring Graphs with Girth Five and Large Maximum Degree. In José R. Correa, Alejandro Hevia, Marcos A. Kiwi, editors, LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings. Volume 3887 of Lecture Notes in Computer Science, pages 665-676, Springer, 2006. [doi]

@inproceedings{LauM06:0,
  title = {Randomly Colouring Graphs with Girth Five and Large Maximum Degree},
  author = {Lap Chi Lau and Michael Molloy},
  year = {2006},
  doi = {10.1007/11682462_61},
  url = {http://dx.doi.org/10.1007/11682462_61},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/LauM06%3A0},
  cites = {0},
  citedby = {0},
  pages = {665-676},
  booktitle = {LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings},
  editor = {José R. Correa and Alejandro Hevia and Marcos A. Kiwi},
  volume = {3887},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-32755-X},
}