𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Local structure of 7- and 8-connected graphs

✍ Scribed by S. A. Obraztsova; A. V. Pastor

Book ID
106436603
Publisher
Springer US
Year
2011
Tongue
English
Weight
216 KB
Volume
179
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

2-connected 7-coverings of 3-connected g
2-connected 7-coverings of 3-connected graphs on surfaces
✍ Ken-ichi Kawarabayashi; Atsuhiro Nakamoto; Katsuhiro Ota πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 116 KB πŸ‘ 1 views

## Abstract An __m__‐__covering__ of a graph __G__ is a spanning subgraph of __G__ with maximum degree at most __m__. In this paper, we shall show that every 3‐connected graph on a surface with Euler genus __k__ β‰₯ 2 with sufficiently large representativity has a 2‐connected 7‐covering with at most

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) = Ξ΄