Introduces (k,l,m)-decomposition proving bounded clique width in Free{C4,4K1} subclasses found via program, and constructs infinite families with unbounded clique width from 3-clique-coverable graphs.
On the clique-width of (
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
-
A program to find families of graphs in Free$\{C_4,4K_1\}$ with bounded clique width
Introduces (k,l,m)-decomposition proving bounded clique width in Free{C4,4K1} subclasses found via program, and constructs infinite families with unbounded clique width from 3-clique-coverable graphs.