𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Structure of ak-Connected Graph

✍ Scribed by D. V. Karpov; A. V. Pastor

Book ID
110404362
Publisher
Springer US
Year
2003
Tongue
English
Weight
318 KB
Volume
113
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Removable edges in cycles of ak-connecte
Removable edges in cycles of ak-connected graph
✍ Li Qiong Xu; Xiao Feng Guo πŸ“‚ Article πŸ“… 2011 πŸ› Institute of Mathematics, Chinese Academy of Scien 🌐 English βš– 194 KB
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

The structure of quasi 4-connected graph
The structure of quasi 4-connected graphs
✍ Themistocles Politof; A. Satyanarayana πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 646 KB

A minimal point disconnecting set S of a graph G is a nontrivial m-separator, where m = IS I, if the connected components of G -S can be partitioned into two subgraphs each of which has at least two points. A 3-connected graph is quasi 4-connected if it has no nontrivial 3separators. This paper prov

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