Co-bipartite graphs are word-representable precisely when they avoid certain induced subgraphs, equivalently when their adjacency matrices satisfy the circularly compatible ones property, yielding a linear-time recognition algorithm.
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
UNVERDICTED 1representative citing papers
citing papers explorer
-
Forbidden Induced Subgraph Characterization of Word-Representable Co-bipartite Graphs
Co-bipartite graphs are word-representable precisely when they avoid certain induced subgraphs, equivalently when their adjacency matrices satisfy the circularly compatible ones property, yielding a linear-time recognition algorithm.