𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Planar minimally rigid graphs and pseudo-triangulations

✍ Scribed by Ruth Haas; David Orden; Günter Rote; Francisco Santos; Brigitte Servatius; Herman Servatius; Diane Souvaine; Ileana Streinu; Walter Whiteley

Book ID
108100930
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
397 KB
Volume
31
Category
Article
ISSN
0925-7721

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the minimal reducible bound for outer
On the minimal reducible bound for outerplanar and planar graphs
✍ Peter Mihók 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Let L be the set of all additive and hereditary properties of graphs. For P1, P2 E L we define the reducible property R = P1P2 as follows: G E PtP2 if there is a bipartition (V~,/1"2) of V(G) such that (V~) E Pi and (V2) E P2. For a property P E L, a reducible property R is called a minimal reducibl

On the max-cut problem for a planar, cub
On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation
✍ Carsten Thomassen 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB 👁 2 views

## Abstract Every 3‐connected planar, cubic, triangle‐free graph with __n__ vertices has a bipartite subgraph with at least 29__n__/24 − 7/6 edges. The constant 29/24 improves the previously best known constant 6/5 which was considered best possible because of the graph of the dodecahedron. Example