"Coloring 3-Colorable Graphs with Less than n^1/5 Colors."

Ken-ichi Kawarabayashi, Mikkel Thorup (2017)

> Home

Details and statistics

DOI: 10.1145/3001582

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/KawarabayashiT17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/KawarabayashiT17
Ken-ichi Kawarabayashi, Mikkel Thorup:
Coloring 3-Colorable Graphs with Less than n^1/5 Colors. J. ACM 64(1): 4:1-4:23 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.