Robertson and Seymour conjectured that the treewidth of a planar graph and the treewidth of its geometric dual di er by at most one. Lapoire solved the conjecture in the a rmative, using algebraic techniques. We give here a much shorter proof of this result.
β¦ LIBER β¦
Plane Embeddings of Planar Graph Metrics
β Scribed by MohammadHossein Bateni; Erik D. Demaine; MohammadTaghi Hajiaghayi; Mohammad Moharrami
- Publisher
- Springer
- Year
- 2007
- Tongue
- English
- Weight
- 279 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0179-5376
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Chordal embeddings of planar graphs
β
V. BouchittΓ©; F. Mazoit; I. Todinca
π
Article
π
2003
π
Elsevier Science
π
English
β 361 KB
Weak embedding of planar graphs
β
Wei Erling; Liu Yanpei
π
Article
π
2006
π
Springer-Verlag
π
English
β 217 KB
Disk Embeddings of Planar Graphs
β
Zhi-Zhong Chen; Xin He
π
Article
π
2003
π
Springer
π
English
β 539 KB
Boolean approach to planar embeddings of
β
Liu Yanpei
π
Article
π
1989
π
Institute of Mathematics, Chinese Academy of Scien
π
English
β 922 KB
On-line Planar Graph Embedding
β
Roberto Tamassia
π
Article
π
1996
π
Elsevier Science
π
English
β 504 KB
We present a dynamic data structure for the incremental construction of a planar embedding of a planar graph. The data structure supports the following Ε½ . operations: i testing if a new edge can be added to the embedding without Ε½ . introducing crossing; and ii adding vertices and edges. The time c
On optimal embeddings of metrics in grap
β
Wilfried Imrich; J.M.S SimΓ΅es-Pereira; Christina M Zamfirescu
π
Article
π
1984
π
Elsevier Science
π
English
β 700 KB