Treewidth of planar graphs: connections with duality - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2001

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.
Fichier principal
Vignette du fichier
_connections_with_duality.pdf (79.37 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00351167 , version 1 (08-01-2009)

Identifiants

Citer

Vincent Bouchitté, Frédéric . Mazoit, Ioan Todinca. Treewidth of planar graphs: connections with duality. Euroconference on Combinatorics, Graph Theory and Applications, Sep 2001, Barcelona, France. pp.34-38, ⟨10.1016/S1571-0653(04)00353-1⟩. ⟨hal-00351167⟩
177 Consultations
303 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More