✦ LIBER ✦

On boolean characterizations of planarity and planar embeddings of graphs

✍ Scribed by Yanpei Liu

Book ID: 112713120
Publisher: Springer US
Year: 1990
Tongue: English
Weight: 391 KB
Volume: 24
Category: Article
ISSN: 0254-5330
DOI: 10.1007/bf02216821

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Boolean planarity characterization of gr

Boolean planarity characterization of graphs

✍ Liu Yanpei 📂 Article 📅 1988 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 669 KB

Boolean approach to planar embeddings of

Boolean approach to planar embeddings of a graph

✍ Liu Yanpei 📂 Article 📅 1989 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 922 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

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.

Minimally knotted embeddings of planar g

Minimally knotted embeddings of planar graphs

✍ Ying-Qing Wu 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 French ⚖ 327 KB