Treewidth of graphs with balanced separations
Abstract
We prove that if every subgraph of a graph G has a balanced separation of order at most a then G has treewidth at most 15a. This establishes a linear dependence between the treewidth and the separation number.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.