 |
HAL-LARA Libre accès aux rapports scientifiques et techniques |
 |
Reports
Chordal embeddings of planar graph
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.
https://hal-lara.archives-ouvertes.fr/hal-02101804
Contributor : Colette ORANGE Connect in order to contact the contributor
Submitted on : Wednesday, April 17, 2019 - 9:06:43 AM
Last modification on : Saturday, September 11, 2021 - 3:19:19 AM
Contributor : Colette ORANGE Connect in order to contact the contributor
Submitted on : Wednesday, April 17, 2019 - 9:06:43 AM
Last modification on : Saturday, September 11, 2021 - 3:19:19 AM
File
RR2001-47.pdf
Files produced by the author(s)
