Classifies minimal non-comparability graphs by word-representability and shows the cover number by comparability graphs is Θ(log n) for some word-representable graphs on n vertices.
In: Editor, F., Editor, S
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Word-representability and comparability: Minimal forbidden induced subgraphs and cover number bounds
Classifies minimal non-comparability graphs by word-representability and shows the cover number by comparability graphs is Θ(log n) for some word-representable graphs on n vertices.