The Gallai vertex problem is Θ₂^p-complete.
Title resolution pending
1 Pith paper cite this work, alongside 21 external citations. Polarity classification is still indexing.
1
Pith paper citing it
21
external citations · OpenAlex
fields
cs.DM 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Gallai Vertex Problem is $\Theta_2^p$-Complete
The Gallai vertex problem is Θ₂^p-complete.