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

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). New York: ACM Press.
Hayes, T. ; Vigoda, E. ; Vera, J.C. / Randomly coloring planar graphs with fewer colors than the maximum degree. Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC 2007), San Diego, California, USA, June 11-13, 2007. editor / D.S. Johnson ; U. Feige. Vol. 39 New York : ACM Press, 2007. pp. 450-458
@inproceedings{588323ce4dfe44f0aadabb4dbc21d815,
title = "Randomly coloring planar graphs with fewer colors than the maximum degree",
author = "T. Hayes and E. Vigoda and J.C. Vera",
note = "Pagination: 9",
year = "2007",
language = "English",
isbn = "9781595936318",
volume = "39",
publisher = "ACM Press",
pages = "450--458",
editor = "D.S. Johnson and U. Feige",
booktitle = "Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC 2007), San Diego, California, USA, June 11-13, 2007",

}

Hayes, T, Vigoda, E & Vera, JC 2007, Randomly coloring planar graphs with fewer colors than the maximum degree. in DS 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, ACM Press, New York, pp. 450-458.

Randomly coloring planar graphs with fewer colors than the maximum degree. / Hayes, T.; Vigoda, E.; Vera, J.C.

Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC 2007), San Diego, California, USA, June 11-13, 2007. ed. / D.S. Johnson; U. Feige. Vol. 39 New York : ACM Press, 2007. p. 450-458.

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

TY - GEN

T1 - Randomly coloring planar graphs with fewer colors than the maximum degree

AU - Hayes, T.

AU - Vigoda, E.

AU - Vera, J.C.

N1 - Pagination: 9

PY - 2007

Y1 - 2007

M3 - Conference contribution

SN - 9781595936318

VL - 39

SP - 450

EP - 458

BT - Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC 2007), San Diego, California, USA, June 11-13, 2007

A2 - Johnson, D.S.

A2 - Feige, U.

PB - ACM Press

CY - New York

ER -

Hayes T, Vigoda E, Vera JC. Randomly coloring planar graphs with fewer colors than the maximum degree. In Johnson DS, Feige U, editors, Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC 2007), San Diego, California, USA, June 11-13, 2007. Vol. 39. New York: ACM Press. 2007. p. 450-458