✦ LIBER ✦

A simple theorem on 3-connectivity

✍ Scribed by Robert E. Bixby

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 245 KB
Volume: 45
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(82)90214-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A cyclic connectivity theorem for hypers

A cyclic connectivity theorem for hyperspaces

✍ L.E. Ward Jr. 📂 Article 📅 1979 🏛 Elsevier Science ⚖ 459 KB

Theorems on matroid connectivity

✍ T. Inukai; L. Weinberg 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 135 KB

A Simple 3-Edge-Connected Component Algo

A Simple 3-Edge-Connected Component Algorithm

✍ Yung H. Tsin 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 407 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

On the Simple Connectivity of Fatou Comp

On the Simple Connectivity of Fatou Components

✍ Chun Lei Cao; Yue Fei Wang 📂 Article 📅 2002 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 139 KB

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