Parameters Tied to Treewidth
Combinatorics
2016-01-29 v2
Abstract
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.
Keywords
Cite
@article{arxiv.1312.3401,
title = {Parameters Tied to Treewidth},
author = {Daniel J. Harvey and David R. Wood},
journal= {arXiv preprint arXiv:1312.3401},
year = {2016}
}
Comments
22 pages, 1 figure