Abstract:
Using an algebraic representation for graphs of bounded pathwidth
or treewidth we provide simple methods for generating these families in
increasing order of the number of vertices and edges. We also study canonic
representions of fixed- and free- boundaried graphs of bounded width.