On Balanced Separators, Treewidth, and Cycle Rank

Abstract

We investigate relations between different width parameters of graphs, in particular balanced separator number, treewidth, and cycle rank. Our main result states that a graph with balanced separator number k has treewidth at least k but cycle rank at most k · ( 1 + log nk ) , thus refining the previously known bounds, as stated by Robertson and Seymour… (More)

Topics

Cite this paper

@article{Gruber2010OnBS, title={On Balanced Separators, Treewidth, and Cycle Rank}, author={Hermann Gruber}, journal={CoRR}, year={2010}, volume={abs/1012.1344} }