Title of article
Chordal embeddings of planar graphs Original Research Article
Author/Authors
V. Bouchitté، نويسنده , , F. Mazoit، نويسنده , , I. Todinca، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
18
From page
85
To page
102
Abstract
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.
Keywords
Planar graphs , Treewidth , Duality
Journal title
Discrete Mathematics
Serial Year
2003
Journal title
Discrete Mathematics
Record number
948688
Link To Document