On the tree-thinness of a graph

BONOMO, FLAVIA; FAENZA, YURI

Haifa

Workshop; Haifa Workshop on Graph Theory, Combinatorics, and Algorithms; 2013

In this work in progress we propose a definition for the concept of tree-thinness that generalizes both thinness and treewidth and a framework to describe a wide family of problems that can be solved by dynamic programming techniques on graphs with bounded tree-thinness k, when the k-tree-thinness representation of the graph is given.