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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Finiteness of k-vertex-critical graphs holds in (P4+ℓP1, chair)-free, (P4+ℓP1,P5,bull)-free, (P4+ℓP1,P5,cricket)-free, and more generally (P4+ℓP1,B4(m),B3(m)+)-free graphs, with χ ≤ ℓ+2 for (P4+ℓP1,K3)-free graphs.
citing papers explorer
-
Vertex-critical graphs in subfamilies of $(P_4+\ell P_1)$-free graphs
Finiteness of k-vertex-critical graphs holds in (P4+ℓP1, chair)-free, (P4+ℓP1,P5,bull)-free, (P4+ℓP1,P5,cricket)-free, and more generally (P4+ℓP1,B4(m),B3(m)+)-free graphs, with χ ≤ ℓ+2 for (P4+ℓP1,K3)-free graphs.