Chordal embeddings of planar graphs

Vincent Bouchitté (1) , Frédéric Mazoit (1) , Ioan Todinca (2)

1 LIP - Laboratoire de l'Informatique du Parallélisme
2 LIFO - Laboratoire d'Informatique Fondamentale d'Orléans

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 this conjecture in the affirmative, using algebraic techniques. We give a much shorter proof of this result.

Mots clés: treewidth; planar graphs; duality

Domaines: Algorithme et structure de données [cs.DS]; Mathématique discrète [cs.DM]

Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca. Chordal embeddings of planar graphs. Discrete Mathematics, 2003, 273, pp.(1-3):85-102. ⟨hal-00085469⟩