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 bounded pathwidth? We prove that every graph with bounded pathwidth and bounded maximum degree has a tree-partition of bounded width, with the extra property that the underlying tree has bounded pathwidth. Moreover, we prove a lower bound showing that the bound on the pathwidth of the underlying tree is within a constant factor of optimal.