Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"$d$-to-$1$ Hardness of Coloring $4$-colorable Graphs with $O(1)$ colors."

Venkatesan Guruswami, Sai Sandeep (2019)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2022-09-27

- view
  - electronic edition @ weizmann.ac.il (open access)
- export record
  dblp key:
  - journals/eccc/GuruswamiS19a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/GuruswamiS19a
Venkatesan Guruswami, Sai Sandeep:
$d$-to-$1$ Hardness of Coloring $4$-colorable Graphs with $O(1)$ colors. Electron. Colloquium Comput. Complex. TR19 (2019)

a service of

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.