Abstract
In this paper we present a new technique for computing lower bounds for graph
treewidth. Our technique is based on the fact that the treewidth of a graph G is
the maximum order of a bramble of G minus one. We give two algorithms: one
for general graphs, and one for planar graphs.
... read more