✦ LIBER ✦

Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three

✍ Scribed by Marwan Al-Jubeh; Mashhood Ishaque; Kristóf Rédei; Diane L. Souvaine; Csaba D. Tóth; Pavel Valtr

Book ID: 106149228
Publisher: Springer
Year: 2011
Tongue: English
Weight: 967 KB
Volume: 61
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-011-9551-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Connectivity augmentation in planar stra

Connectivity augmentation in planar straight line graphs

✍ Csaba D. Tóth 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 442 KB

Straight line embeddings of cubic planar

Straight line embeddings of cubic planar graphs with integer edge lengths

✍ Jim Geelen; Anjie Guo; David McKinnon 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB

## Abstract We prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:270‐274, 2008

The augmentation of undirected weighted

The augmentation of undirected weighted graph to aK-edge-connected graph

✍ Sun Lishan; Sun Yugeng; Yang Shan 📂 Article 📅 1992 🏛 SP Science Press 🌐 English ⚖ 349 KB

The minimum augmentation of any graph to

The minimum augmentation of any graph to a K-edge-connected graph

✍ Guo-Ray Cai; Yu-Geng Sun 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 883 KB

Minimum augmentation of a tree to a K-ed

Minimum augmentation of a tree to a K-edge-connected graph

✍ Shuichi Ueno; Yoji Kajitani; Hajime Wada 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

The minimum augmentation of a directed t

The minimum augmentation of a directed tree to a k-edge-connected directed graph

✍ Yoji Kajitani; Shuichi Ueno 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 520 KB