Topological characterization of families of graphs generated by certain types of graph grammars

Abstract

A precise topological characterization of classes of graphs generated by certain context free graph grammars (CFGG) is given. An informal interpretation of the results is that CFGG cannot generate any interesting classes of graphs besides trees and series-parallel networks, except in trivial ways (e.g. by including subgraphs of higher connectivity explicitly in the production rules).