--
Hugo Jacob
(LaBRI)
summary: Tree-partitions are graph decompositions that correspond to mapping vertices to nodes
of a tree in such a way that adjacent vertices in the graph are either mapped to adjacent nodes
of the tree or to the same node. The width of a tree-partition is the maximum number of vertices ...
