The Logical Exprssion of Graph Properties (Abstract)

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

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

[3]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[4]  Detlef Seese,et al.  Problems Easy for Tree-Decomposable Graphs (Extended Abstract) , 1988, ICALP.

[5]  Paris C. Kanellakis,et al.  Elements of Relational Database Theory , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[6]  Bruno Courcelle,et al.  Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[7]  Bruno Courcelle,et al.  Graphs as Relational Structures: An Algebraic an Logical Approach , 1990, Graph-Grammars and Their Application to Computer Science.

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