Coloring 3-colorable graphs with less than n1/5 colors

Coloring 3-colorable graphs with less than n^1/5 colors

Ken-ichi Kawarabayashi, Mikkel Thorup

Research output: Contribution to journal › Journal article › Research › peer-review

26 Citations (Scopus)

@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",

}