✦ LIBER ✦

Common-Face Embeddings of Planar Graphs

✍ Scribed by Chen, Zhi-Zhong; He, Xin; Kao, Ming-Yang

Book ID: 118181115
Publisher: Society for Industrial and Applied Mathematics
Year: 2003
Tongue: English
Weight: 329 KB
Volume: 32
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s009753970037775x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Geodesic Embeddings and Planar Graphs

✍ Stefan Felsner 📂 Article 📅 2003 🏛 Springer Netherlands 🌐 English ⚖ 282 KB

Minimally knotted embeddings of planar g

Minimally knotted embeddings of planar graphs

✍ Ying-Qing Wu 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 French ⚖ 327 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.

Re-embeddings of Maximum 1-Planar Graphs

✍ Suzuki, Yusuke 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 300 KB