... and where multi-edges are allowed It is actually very easy to adapt the grammar for the corresponding simple family of graphs Call G the subfamily of graphs in G that have no multiple edges and ... decomposition grammar into an enumerative strategy in an automatic way As an example, consider the class T of nonplane rooted trees Such a tree is made of a root vertex and a collection of subtrees ... edges are allowed in the first formulation of the grammar, then we will explain how to adapt the grammar to simple graphs in Section 5.4) In the case of a class of graphs, we will need to take both...