𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Local Structure of 9- and 10-Connected Graphs

✍ Scribed by S. A. Obraztsova

Book ID
113072929
Publisher
Springer US
Year
2012
Tongue
English
Weight
466 KB
Volume
184
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A local structure theorem on 5-connected
A local structure theorem on 5-connected graphs
✍ Kiyoshi Ando πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 281 KB

## Abstract An edge of a 5‐connected graph is said to be contractible if the contraction of the edge results in a 5‐connected graph. Let __x__ be a vertex of a 5‐connected graph. We prove that if there are no contractible edges whose distance from __x__ is two or less, then either there are two tri

On local connectivity of graphs
On local connectivity of graphs
✍ Lutz Volkmann πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 151 KB

The local connectivity ΞΊ(u, v) of two vertices u and v in a graph G is the maximum number of internally disjoint u-v paths in G, and the connectivity of G is defined as } for all pairs u and v of vertices in G. Let Ξ΄(G) be the minimum degree of G. We call a graph G maximally connected when ΞΊ(G) = Ξ΄

On the Structure of 3-connected Matroids
On the Structure of 3-connected Matroids and Graphs
✍ James Oxley; Haidong Wu πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 249 KB

An element e of a 3-connected matroid M is essential if neither the deletion M\e nor the contraction M/e is 3-connected. Tutte's Wheels and Whirls Theorem proves that the only 3-connected matroids in which every element is essential are the wheels and whirls. In this paper, we consider those 3-conne