𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Re-embeddings of Maximum 1-Planar Graphs

✍ Scribed by Suzuki, Yusuke


Book ID
115490726
Publisher
Society for Industrial and Applied Mathematics
Year
2010
Tongue
English
Weight
300 KB
Volume
24
Category
Article
ISSN
0895-4801

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.

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
Re-embedding structures of 4-connected p
✍ Yusuke Suzuki πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 212 KB

We identify the structures of 4-connected projective-planar graphs which generate their inequivalent embeddings on the projective plane, showing two series of graphs the number of whose inequivalent embeddings is held by O(n) with respect to the number of its vertices n.

Enumeration of projective-planar embeddi
✍ 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.