Name
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0012-365X(03)00230-9 | Discrete Mathematics |
Keywords | Field | DocType |
planar graphs,duality,treewidth,planar graph | Discrete mathematics,Combinatorics,Outerplanar graph,Partial k-tree,Chordal graph,Tree decomposition,Clique-sum,Treewidth,Pathwidth,1-planar graph,Mathematics | Journal |
Volume | Issue | ISSN |
273 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
16 | 1.02 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vincent Bouchitté | 1 | 172 | 12.07 |
| F. Mazoit | 2 | 17 | 1.42 |
| I. Todinca | 3 | 35 | 2.01 |