𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimally knotted embeddings of planar graphs

✍ Scribed by Ying-Qing Wu

Book ID
110559830
Publisher
Springer-Verlag
Year
1993
Tongue
French
Weight
327 KB
Volume
214
Category
Article
ISSN
0025-5874

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Disk Embeddings of Planar Graphs
Disk Embeddings of Planar Graphs
✍ Zhi-Zhong Chen; Xin He πŸ“‚ Article πŸ“… 2003 πŸ› Springer 🌐 English βš– 539 KB
Chordal embeddings of planar graphs
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.

Common-Face Embeddings of Planar Graphs
Common-Face Embeddings of Planar Graphs
✍ Chen, Zhi-Zhong; He, Xin; Kao, Ming-Yang πŸ“‚ Article πŸ“… 2003 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 329 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.