Treewidth of planar graphs: connections with duality
Résumé
Robertson and Seymour conjectured that the treewidth of a planar graph and the treewidth of its geometric dual differ by at most one. Lapoire solved the conjecture in the affirmative, using algebraic techniques. We give here a much shorter proof of this result.
Domaines
Mathématique discrète [cs.DM]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...