𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Circular embeddings of planar graphs in nonspherical surfaces

✍ Scribed by R.B. Richter; P.D. Seymour; J. Širáň

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
506 KB
Volume
126
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

We show that every 3-connected planar graph has a circular embedding in some nonspherical surface. More generally, we characterize those planar graphs that have a 2-representative embedding in some nonspherical surface.

This is proved in Section 3. Standard results in the theory show that it suffices to consider the question for 2-connected graphs. For a 2-connected graph G, an embedding of G in some

📜 SIMILAR VOLUMES

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.

On convex embeddings of planar 3-connect
On convex embeddings of planar 3-connected graphs
✍ Kelmans, Alexander 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB 👁 2 views

A well-known Tutte's theorem claims that every 3-connected planar graph has a convex embedding into the plane. Tutte's arguments also show that, moreover, for every nonseparating cycle C of a 3-connected graph G, there exists a convex embedding of G such that C is a boundary of the outer face in thi

Unique and faithful embeddings of projec
Unique and faithful embeddings of projective-planar graphs
✍ Seiya Negami 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 393 KB

A graph G is uniquelyembeddable in a surface f 2 if for any two embeddings f,,f2 : G + f 2 , there exists an isomorphism u : G + G and a homeo- admits an embedding f : G + F2 such that for any isomorphism (T : G + G, there is a homeomorphism h : F 2 f 2 with h . f = f . u. It will be shown that if

3-Coloring graphs embedded in surfaces
3-Coloring graphs embedded in surfaces
✍ Zhao, Yue 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 66 KB 👁 3 views

In this article, we show that there exists an integer k(Σ)