The class of graphs with no induced subdivision of H has bounded clique-width if and only if H is an induced subgraph of P4, paw, or diamond.
Treewidth versus clique number
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Clique-width and induced topological minors
The class of graphs with no induced subdivision of H has bounded clique-width if and only if H is an induced subgraph of P4, paw, or diamond.