𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dynamic Subgraph Connectivity with Geometric Applications

✍ Scribed by Chan, Timothy M.

Book ID
118181284
Publisher
Society for Industrial and Applied Mathematics
Year
2006
Tongue
English
Weight
202 KB
Volume
36
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Connected subgraphs with small degree su
Connected subgraphs with small degree sums in 3-connected planar graphs
✍ Enomoto, Hikoe; Ota, Katsuhiro πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 213 KB πŸ‘ 2 views

It is well-known that every planar graph has a vertex of degree at most five. Kotzig proved that every 3-connected planar graph has an edge xy such that deg(x) + deg(y) ≀ 13. In this article, considering a similar problem for the case of three or more vertices that induce a connected subgraph, we sh

Dynamic 2-Connectivity with Backtracking
Dynamic 2-Connectivity with Backtracking
✍ La PoutrΓ©, Johannes A.; Westbrook, Jeffery πŸ“‚ Article πŸ“… 1998 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 289 KB
On 2-Connected Spanning Subgraphs with L
On 2-Connected Spanning Subgraphs with Low Maximum Degree
✍ Daniel P Sanders; Yue Zhao πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 408 KB

Given a graph G, let a k-trestle of G be a 2-connected spanning subgraph of G of maximum degree at most k. Also, let /(G) be the Euler characteristic of G. This paper shows that every 3-connected graph G has a (10&2/(G))-trestle. If /(G) &5, this is improved to 8&2/(G), and for /(G) &10, this is fur