✦ LIBER ✦

Weak embedding of planar graphs

✍ Scribed by Wei Erling; Liu Yanpei

Publisher: Springer-Verlag
Year: 2006
Tongue: English
Weight: 217 KB
Volume: 21
Category: Article
ISSN: 1598-5865
DOI: 10.1007/bf02896396

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

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.

Disk Embeddings of Planar Graphs

✍ Zhi-Zhong Chen; Xin He 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 539 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

Plane Embeddings of Planar Graph Metrics

✍ MohammadHossein Bateni; Erik D. Demaine; MohammadTaghi Hajiaghayi; Mohammad Moha 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 279 KB

Embedding Planar Graphs at Fixed Vertex

Embedding Planar Graphs at Fixed Vertex Locations

✍ János Pach; Rephael Wenger 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 155 KB

Enumeration of projective-planar embeddi

Enumeration of projective-planar embeddings of graphs

✍ Seiya Negami 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 562 KB

It will be shown that the number of equivalence classes of embeddings of a 3-connected nonplanar graph into a projective plane coincides with the number of isomorphism classes of planar double coverings of the graph and a combinatorial method to determine the number will be developed.