25 citations · 246 across the 55 of their papers we have counts for
Showing 2014 · math.COShow all
2 papers · 2 filters
math.CO2014
Treewidth of graphs with balanced separations
Zdenek Dvorak, Sergey Norin
We prove that if every subgraph of a graph has a balanced separation of order at most then has treewidth at most . This establishes a linear dependence between the…
math.CO2014★ 6 cited
Non-planar extensions of subdivisions of planar graphs
Sergey Norin, Robin Thomas
Almost -connectivity is a weakening of -connectivity which allows for vertices of degree three. In this paper we prove the following theorem. Let be an almost -connect…