Coloring 3-colorable graphs with less than n1/5 colors
Research output: Contribution to journal › Journal article › Research › peer-review
Standard
Coloring 3-colorable graphs with less than n1/5 colors. / Kawarabayashi, Ken-ichi; Thorup, Mikkel.
In: Journal of the ACM, Vol. 64, No. 1, 4, 03.2017.Research output: Contribution to journal › Journal article › Research › peer-review
Harvard
Kawarabayashi, K & Thorup, M 2017, 'Coloring 3-colorable graphs with less than n1/5 colors', Journal of the ACM, vol. 64, no. 1, 4. https://doi.org/10.1145/3001582
APA
Kawarabayashi, K., & Thorup, M. (2017). Coloring 3-colorable graphs with less than n1/5 colors. Journal of the ACM, 64(1), [4]. https://doi.org/10.1145/3001582
Vancouver
Kawarabayashi K, Thorup M. Coloring 3-colorable graphs with less than n1/5 colors. Journal of the ACM. 2017 Mar;64(1). 4. https://doi.org/10.1145/3001582
Author
Bibtex
@article{e069c06a89ca4faa8dae9107fb8241c7,
title = "Coloring 3-colorable graphs with less than n1/5 colors",
author = "Ken-ichi Kawarabayashi and Mikkel Thorup",
year = "2017",
month = mar,
doi = "10.1145/3001582",
language = "English",
volume = "64",
journal = "Journal of the ACM",
issn = "0004-5411",
publisher = "Association for Computing Machinery",
number = "1",
}
RIS
TY - JOUR
T1 - Coloring 3-colorable graphs with less than n1/5 colors
AU - Kawarabayashi, Ken-ichi
AU - Thorup, Mikkel
PY - 2017/3
Y1 - 2017/3
U2 - 10.1145/3001582
DO - 10.1145/3001582
M3 - Journal article
VL - 64
JO - Journal of the ACM
JF - Journal of the ACM
SN - 0004-5411
IS - 1
M1 - 4
ER -
ID: 179527854