Monadic second-order definable graph transductions: a survey
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Journal of Combinatorial Theory Series B
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Approximating clique-width and branch-width
Journal of Combinatorial Theory Series B
Recent developments on graphs of bounded clique-width
Discrete Applied Mathematics
The rank-width of the square grid
Discrete Applied Mathematics
Polynomial-time recognition of clique-width ≤3 graphs
Discrete Applied Mathematics
Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach
Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach
Parameterized Complexity
Width Parameters Beyond Tree-width and their Applications
The Computer Journal
| Hi-index | 0.89 |
We prove that edge contractions do not preserve the property that a set of graphs has bounded clique-width.