Proves NP-hardness of determining if an oriented graph has degreewidth at most 1, settling the last open case for oriented graphs.
Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Establishes n^{1-ε}-hardness of approximation for dichromatic number and acyclic number on tournaments, plus polynomial-time approximations for ℓ-dicolorable digraphs and special dense cases.
citing papers explorer
-
Computing the degreewidth of a digraph is hard
Proves NP-hardness of determining if an oriented graph has degreewidth at most 1, settling the last open case for oriented graphs.
-
Hardness and Approximation for Coloring Digraphs
Establishes n^{1-ε}-hardness of approximation for dichromatic number and acyclic number on tournaments, plus polynomial-time approximations for ℓ-dicolorable digraphs and special dense cases.