Year: 2022
Type: preprint
Abstract: A "tree-partition" of a graph $G$ is a partition of $V(G)$ such that identifying the vertices in each part gives a tree. It is known that every graph with treewidth $k$ and maximum degree $Δ$ has a tree-partition with parts of size $O(kΔ)$. We prove the same result with the extra property that the underlying tree has maximum degree $O(Δ)$ and $O(|V(G)|/k)$ vertices.
Source: arXiv (Cornell University)
Authors: Distel, Marc, Wood, David R.
Institution: Monash University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Australian Government
OpenAlex ID: W4307311786