𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Convex Drawings of 3-Connected Plane Graphs

✍ Scribed by Nicolas Bonichon; Stefan Felsner; Mohamed Mosbah

Publisher
Springer
Year
2007
Tongue
English
Weight
410 KB
Volume
47
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Box-Rectangular Drawings of Plane Graphs
Box-Rectangular Drawings of Plane Graphs
✍ Md.Saidur Rahman; Shin-ichi Nakano; Takao Nishizeki πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 413 KB

In this paper we introduce a new drawing style of a plane graph G called a box-rectangular drawing. It is defined to be a drawing of G on an integer grid such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal line segment or a vertical line segment, a

On 3-Connected Plane Graphs without Tria
On 3-Connected Plane Graphs without Triangular Faces
✍ J. Harant; S. Jendrol'; M. TkΓ‘c πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 151 KB

We prove that each polyhedral triangular face free map G on a compact 2-dimensional manifold M with Euler characteristic /(M) contains a k-path, i.e., a path on k vertices, such that each vertex of this path has, in G, degree at most (5Γ‚2) k if M is a sphere S 0 and at most (kΓ‚2)w(5+-49&24/(M))Γ‚2x i