Computing the clique number of tournaments

Guillaume Aubian · 2024 · arXiv 2401.07776

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

representative citing papers

math.CO · 2024-07-27 · unverdicted · novelty 8.0

Proves NP-hardness of determining if an oriented graph has degreewidth at most 1, settling the last open case for oriented graphs.

Showing 1 of 1 citing paper.

Computing the degreewidth of a digraph is hard math.CO · 2024-07-27 · unverdicted · none · ref 5
Proves NP-hardness of determining if an oriented graph has degreewidth at most 1, settling the last open case for oriented graphs.