𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A cyclic connectivity theorem for hyperspaces

✍ Scribed by L.E. Ward Jr.

Publisher
Elsevier Science
Year
1979
Weight
459 KB
Volume
10
Category
Article
ISSN
0016-660X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fan-type theorem for path-connectivity
Fan-type theorem for path-connectivity
✍ Zhiquan Hu; Feng Tian; Bing Wei; Yoshimi Egawa; Kazuhide Hirohata πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 165 KB

## Abstract For a connected noncomplete graph __G__, let ΞΌ(__G__):=min{max {__d__~__G__~(__u__), __d__~__G__~(v)}:__d__~__G__~(__u__, v)=2}. A well‐known theorem of Fan says that every 2‐connected noncomplete graph has a cycle of length at least min{|__V__(__G__)|, 2ΞΌ(__G__)}. In this paper, we pro

A simple theorem on 3-connectivity
A simple theorem on 3-connectivity
✍ Robert E. Bixby πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 245 KB
Matroid 4-Connectivity: A Deletion–Contr
Matroid 4-Connectivity: A Deletion–Contraction Theorem
✍ James Geelen; Geoff Whittle πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 223 KB

A 3-separation (A, B), in a matroid M, is called sequential if the elements of A can be ordered (a 1 , ..., a k ) such that, for i=3, ..., k, ([a 1 , ..., a i ], [a i+1 , ..., a k ] \_ B) is a 3-separation. A matroid M is sequentially 4-connected if M is 3-connected and, for every 3-separation (A, B

Cyclic arc-connectivity in a Cartesian p
Cyclic arc-connectivity in a Cartesian product digraph
✍ Zhao Zhang; Yufang Zhu πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 319 KB

A digraph D is cycle separable if it contains two vertex disjoint directed cycles. For a cycle separating digraph D, an arc set S is a cycle separating arc-cut if D-S has at least two strong components containing directed cycles. The cyclic arc-connectivity Ξ» c (D) is the minimum cardinality of all