Randomly coloring planar graphs with fewer colors than the maximum degree

T. Hayes, E. Vigoda, J.C. Vera

Research output: Chapter in Book/Report/Conference proceedingConference contributionProfessional

18 Citations (Scopus)
Original languageEnglish
Title of host publicationProceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC 2007), San Diego, California, USA, June 11-13, 2007
EditorsD.S. Johnson, U. Feige
Place of PublicationNew York
PublisherACM Press
Pages450-458
Number of pages9
Volume39
ISBN (Print)9781595936318
Publication statusPublished - 2007
Externally publishedYes

Publication series

Name
Volume39

Cite this

Hayes, T., Vigoda, E., & Vera, J. C. (2007). Randomly coloring planar graphs with fewer colors than the maximum degree. In D. S. Johnson, & U. Feige (Eds.), Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC 2007), San Diego, California, USA, June 11-13, 2007 (Vol. 39, pp. 450-458). ACM Press.