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