Information Processing Letters
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
On the size of hereditary classes of graphs
Journal of Combinatorial Theory Series B
Nonredundant 1's in $\Gamma$-Free Matrices
SIAM Journal on Discrete Mathematics
Regular Article: Bi-complement Reducible Graphs
Advances in Applied Mathematics
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Bipartite graphs without a skew star
Discrete Mathematics
On a Generalization of Bi-Complement Reducible Graphs
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Extremal Graph Theory
Clique-width minimization is NP-hard
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
NP-hard graph problems and boundary classes of graphs
Theoretical Computer Science
Recent developments on graphs of bounded clique-width
Discrete Applied Mathematics
A Complete Characterisation of the Linear Clique-Width of Path Powers
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
On the complexity of the dominating induced matching problem in hereditary classes of graphs
Discrete Applied Mathematics
Graphs of separability at most two: structural characterizations and their consequences
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Clique-width for four-vertex forbidden subgraphs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Graphs of separability at most 2
Discrete Applied Mathematics
| Hi-index | 0.00 |
The paper presents several results that can be helpful for deciding whether the clique-width of graphs in a certain class is bounded or not, and applies these results to a number of particular graph classes.