Word-representable split graphs have representation number at most 3, and the graphs with representation number exactly 3 are characterized by a family of induced subgraphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Representation Number of Word-Representable Split Graphs
Word-representable split graphs have representation number at most 3, and the graphs with representation number exactly 3 are characterized by a family of induced subgraphs.