17 citations · 31 across the 6 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2013★ 10 cited
A single exponential bound for the redundant vertex Theorem on surfaces
Frédéric Mazoit
Let s1, t1,. . . sk, tk be vertices in a graph G embedded on a surface σof genus g. A vertex v of G is "redundant" if there exist k vertex disjoint paths linking si and ti (1 \lequ…
math.CO2013★ 4 cited
A simple proof of the tree-width duality theorem
Frédéric Mazoit
We give a simple proof of the "tree-width duality theorem" of Seymour and Thomas that the tree-width of a finite graph is exactly one less than the largest order of its brambles.