50 citations · 50 across the 3 of their papers we have counts for
3 papers
math.CO2026
Tree-partitions of graphs with given pathwidth
David R. Wood
Graphs with bounded treewidth and bounded maximum degree are known to have tree-partitions of bounded width. What can be said if the bounded treewidth assumption is strengthened to…
math.CO2025
Tree decompositions with small width, spread, order and degree
David R. Wood
Tree-decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. The main property of tree-decompositions is the width (the maximum size of a…
math.CO2006★ 50 cited
On Tree-Partition-Width
David R. Wood
A \emph{tree-partition} of a graph is a proper partition of its vertex set into `bags', such that identifying the vertices in each bag produces a forest. The \emph{tree-partiti…