✦ LIBER ✦

Boolean approach to planar embeddings of a graph

✍ Scribed by Liu Yanpei

Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 1989
Tongue: English
Weight: 922 KB
Volume: 5
Category: Article
ISSN: 1439-7617
DOI: 10.1007/bf02107624

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Boolean approaches to graph embeddings r

Boolean approaches to graph embeddings related to VLSI

✍ Yanpei Liu 📂 Article 📅 2001 🏛 SP Science China Press 🌐 English ⚖ 466 KB

Plane Embeddings of Planar Graph Metrics

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

Isometric embedding of a graph in a Bool

Isometric embedding of a graph in a Boolean cube

✍ V. V. Firsov 📂 Article 📅 1965 🏛 Springer US 🌐 English ⚖ 163 KB

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.

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