1 paper · 1 filter
Hussein Houdrouge, Babak Miraftab, Pat Morin
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.