The general position number of digraphs is bounded, proven NP-complete for oriented graphs, and computed for circulant, Kautz, and permutation families.
Dirac, Extensions of Tur´ an’s theorem on graphs, Acta Hung
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The general position number of digraphs
The general position number of digraphs is bounded, proven NP-complete for oriented graphs, and computed for circulant, Kautz, and permutation families.