1. Graph expressions and graph rewriting;Bauderon;Math. Systems Theory,1987
2. On polynomial time graph grammars;Brandenburg,1988
3. The equivalence of boundary and confluent graph grammars on graph languages of bounded degree;Brandenburg,1991
4. An axiomatic definition of context-free rewriting and its application to NLC graph grammars;Courcelle;Theor. Comput. Sci.,1987
5. A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars;Courcelle;Report 91-41,1991