Standard
Coloring 3-colorable graphs with o(n 1/5) colors. / Kawarabayashi, Ken-ichi; Thorup, Mikkel.
31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). ed. / Ernst W. Mayr; Natacha Portier. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. p. 458-469 (Leibniz International Proceedings in Informatics, Vol. 25).
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Kawarabayashi, K
& Thorup, M 2014,
Coloring 3-colorable graphs with o(n 1/5) colors. in EW Mayr & N Portier (eds),
31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics, vol. 25, pp. 458-469, 31st Symposium on Theoretical Aspects of Computer Science, Lyon, France,
05/03/2014.
https://doi.org/10.4230/LIPIcs.STACS.2014.458
APA
Kawarabayashi, K.
, & Thorup, M. (2014).
Coloring 3-colorable graphs with o(n 1/5) colors. In E. W. Mayr, & N. Portier (Eds.),
31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014) (pp. 458-469). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Leibniz International Proceedings in Informatics Vol. 25
https://doi.org/10.4230/LIPIcs.STACS.2014.458
Vancouver
Kawarabayashi K
, Thorup M.
Coloring 3-colorable graphs with o(n 1/5) colors. In Mayr EW, Portier N, editors, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 2014. p. 458-469. (Leibniz International Proceedings in Informatics, Vol. 25).
https://doi.org/10.4230/LIPIcs.STACS.2014.458
Author
Kawarabayashi, Ken-ichi ; Thorup, Mikkel. / Coloring 3-colorable graphs with o(n 1/5) colors. 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). editor / Ernst W. Mayr ; Natacha Portier. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. pp. 458-469 (Leibniz International Proceedings in Informatics, Vol. 25).
Bibtex
@inproceedings{abedd9ca5cc3484d821b6e55533a98dc,
title = "Coloring 3-colorable graphs with o(n 1/5) colors",
author = "Ken-ichi Kawarabayashi and Mikkel Thorup",
note = "Creative Commons License; 31st Symposium on Theoretical Aspects of Computer Science, STACS 2014 ; Conference date: 05-03-2014 Through 08-03-2014",
year = "2014",
doi = "10.4230/LIPIcs.STACS.2014.458",
language = "English",
isbn = "978-3-939897-65-1",
series = "Leibniz International Proceedings in Informatics",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",
pages = "458--469",
editor = "Mayr, {Ernst W.} and Natacha Portier",
booktitle = "31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)",
}
RIS
TY - GEN
T1 - Coloring 3-colorable graphs with o(n 1/5) colors
AU - Kawarabayashi, Ken-ichi
AU - Thorup, Mikkel
N1 - Conference code: 31
PY - 2014
Y1 - 2014
U2 - 10.4230/LIPIcs.STACS.2014.458
DO - 10.4230/LIPIcs.STACS.2014.458
M3 - Article in proceedings
SN - 978-3-939897-65-1
T3 - Leibniz International Proceedings in Informatics
SP - 458
EP - 469
BT - 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
A2 - Mayr, Ernst W.
A2 - Portier, Natacha
PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik
T2 - 31st Symposium on Theoretical Aspects of Computer Science
Y2 - 5 March 2014 through 8 March 2014
ER -