17 citations · 31 across the 6 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2010
Tree-width of hypergraphs and surface duality
Frédéric Mazoit
In Graph Minors III, Robertson and Seymour write: "It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal - indeed, we have…
cs.DM2009★ 17 cited
Partitions versus sets : a case of duality
Laurent Lyaudet, Frédéric Mazoit, Stephan Thomasse
In a recent paper, Amini et al. introduce a general framework to prove duality theorems between special decompositions and their dual combinatorial object. They thus unify all know…
cs.DM2008
Tree-width of hypergraphs and surface duality
Frédéric Mazoit
In Graph Minor III, Robertson and Seymour conjecture that the tree-width of a planar graph and that of its dual differ by at most one. We prove that given a hypergraph H on a surfa…