Trimming weighted graphs of bounded treewidth
Erlebach etal. define the notion of a trimmable class of graphs. This was motivated by a problem in map labelling. Roughly speaking, a class C C of graphs is trimmable if, for each graph G?C G ? C , it is possible to remove a small proportion of the vertices of G G to obtain a graph with no long simple paths. More generally, one considers vertex-weighted graphs and tries to remove a set of vertices of small weight. Erlebach etal. prove that any class of weighted graphs of bounded treewidth and bounded degree is trimmable. They ask whether this remains true if the degree is not required to be bounded. In this paper a positive answer is given.
treewidth map labelling graph trimming