Upper bounds to the clique width of graphs

[1]  Joost Engelfriet,et al.  Node Replacement Graph Grammars , 1997, Handbook of Graph Grammars.

[2]  Tero Harju,et al.  The Theory of 2-Structures - A Framework for Decomposition and Transformation of Graphs , 1997, Handbook of Graph Grammars.

[3]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[4]  Bruno Courcelle,et al.  The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic , 1997, Handbook of Graph Grammars.

[5]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs X: Linear Orderings , 1996, Theor. Comput. Sci..

[6]  Bruno Courcelle,et al.  A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars , 1995, Math. Syst. Theory.

[7]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs VIII: Orientations , 1995, Ann. Pure Appl. Log..

[8]  Bruno Courcelle.  Structural Properties of Context-Free Sets of Graphs Generated by Vertex Replacement , 1995, Inf. Comput..

[9]  Egon Wanke,et al.  k-NLC Graphs and Polynomial Algorithms , 1994, Discret. Appl. Math..

[10]  Michel Habib,et al.  A New Linear Algorithm for Modular Decomposition , 1994, CAAP.

[11]  Peter L. Hammer,et al.  Discrete Applied Mathematics , 1993 .

[12]  Bruno Courcelle,et al.  Handle-Rewriting Hypergraph Grammars , 1993, J. Comput. Syst. Sci..

[13]  Bruno Courcelle,et al.  Monadic Second-Order Evaluations on Tree-Decomposable Graphs , 1991, Theor. Comput. Sci..

[14]  Bruno Courcelle,et al.  An algebraic theory of graph reduction , 1990, JACM.

[15]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs VII: Graphs as Relational Structures , 1992, Theor. Comput. Sci..

[16]  Bruno Courcelle,et al.  The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues , 1992, RAIRO Theor. Informatics Appl..

[17]  Detlef Seese,et al.  The Structure of Models of Decidable Monadic Theories of Graphs , 1991, Ann. Pure Appl. Log..

[18]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[19]  Jan van Leeuwen,et al.  Graph Algorithms , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[20]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs IV: Definability Properties of Equational Graphs , 1990, Ann. Pure Appl. Log..

[21]  Joost Engelfriet,et al.  A Characterization of Context-Free NCE Graph Languages by Monadic Second-Order Logic on Trees , 1990, Graph-Grammars and Their Application to Computer Science.

[22]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[23]  Jeremy P. Spinrad,et al.  Incremental modular decomposition , 1989, JACM.

[24]  Bruno Courcelle,et al.  An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph Grammars , 1987, Theor. Comput. Sci..

[25]  Paul D. Seymour,et al.  Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[26]  Lorna Stewart,et al.  A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..