Graph Languages Defined by Systems of Forbidden Structures: A Survey

This paper deals with different ways of defining graph languages. These are the so-called forbidden structures. Some results on decision problems, their complexity, and set theoretic closure properties are scetched. A normal form, the minimal systems, are given. Finally the influence of the different kinds of forbidden structures on the descriptive power of the systems is shown.

[1]  Wolf-Dietrich Fellner.  On Minimal Graphs , 1982, Theor. Comput. Sci..

[2]  Ken Kennedy,et al.  Graph grammars and global program data flow analysis , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[3]  Frank Wankmüller,et al.  On Decision Problems for Forbidden Structures , 1983, WG.

[4]  Frank Harary,et al.  Graph Theory , 2016 .

[5]  Frank Wankmüller.  Characterization of graph classes by forbidden structures and reductions , 1982, Graph-Grammars and Their Application to Computer Science.

[6]  Jeffrey D. Ullman,et al.  Flow Graph Reducibility , 1972, SIAM J. Comput..