Separation number and treewidth, revisited

Discrete Mathematics 2026 Open access

Read full text
Authors: Hussein Houdrouge, Babak Miraftab, Pat Morin
DOI: 10.1016/j.disc.2026.115322
Cited by: 0

Abstract

We give a constructive proof of the fact that the treewidth of a graph $G$ is bounded by a linear function of the separation number of $G$.

Fields of Study & Subjects

Advanced Graph Theory Research Complexity and Algorithms in Graphs Limits and Structures in Graph Theory

Publication details

Journal / source
Discrete Mathematics
Volume
349
Issue
12
Pages
115322–115322
Publication date
15 July 2026
Language
EN