Parameters Tied to Treewidth [article]

Daniel J. Harvey, David R. Wood
2016 arXiv   pre-print
Treewidth is a graph parameter of fundamental importance to algorithmic and structural graph theory. This paper surveys several graph parameters tied to treewidth, including separation number, tangle number, well-linked number and Cartesian tree product number. We review many results in the literature showing these parameters are tied to treewidth. In a number of cases we also improve known bounds, provide simpler proofs and show that the inequalities presented are tight.
arXiv:1312.3401v2 fatcat:ehinv26yrvbozfri36hmc4yus4