Constrained outer-string representations for {C3,C5}-free graphs are polynomial-time recognizable by forbidden configuration; outer-k-string recognition is NP-hard for every fixed k >= 1.
16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT'18) , editor =
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
Constrained outer-string representations for {C3,C5}-free graphs are polynomial-time recognizable by forbidden configuration; outer-k-string recognition is NP-hard for every fixed k >= 1.