𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Even Triangulations of 2-Connected Embedded Graphs

✍ Scribed by Zhang, Huaming; He, Xin

Book ID
118181187
Publisher
Society for Industrial and Applied Mathematics
Year
2005
Tongue
English
Weight
288 KB
Volume
34
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Spanning even subgraphs of 3-edge-connec
Spanning even subgraphs of 3-edge-connected graphs
✍ Bill Jackson; Kiyoshi Yoshimoto πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 344 KB

## Abstract By Petersen's theorem, a bridgeless cubic graph has a 2‐factor. H. Fleischner extended this result to bridgeless graphs of minimum degree at least three by showing that every such graph has a spanning even subgraph. Our main result is that, under the stronger hypothesis of 3‐edge‐connec

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

On the Connectivity of Graphs Embedded i
On the Connectivity of Graphs Embedded in Surfaces
✍ Michael D Plummer; Xiaoya Zha πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 376 KB

In a 1973 paper, Cooke obtained an upper bound on the possible connectivity of a graph embedded in a surface (orientable or nonorientable) of fixed genus. Furthermore, he claimed that for each orientable genus #>0 (respectively, nonorientable genus #Γ„ >0, #Γ„ {2) there is a complete graph of orientab