Polynomial-time recognition for constrained outer-string representations of {C3,C5}-free graphs with cyclic order, plus NP-hardness for outer-k-string recognition for any fixed k.
Title resolution pending
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
-
Two Results on Outer-String Graphs
Polynomial-time recognition for constrained outer-string representations of {C3,C5}-free graphs with cyclic order, plus NP-hardness for outer-k-string recognition for any fixed k.