𝔖 Bobbio Scriptorium
✦   LIBER   ✦

High connectivity keeping connected subgraph

✍ Scribed by Shinya Fujita; Ken-ichi Kawarabayashi

Book ID
119236580
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
170 KB
Volume
38
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Forcing highly connected subgraphs
Forcing highly connected subgraphs
✍ Maya Jakobine Stein πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 228 KB

## Abstract A theorem of Mader states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. We extend this result to infinite graphs. Here, it is necessary to require not only high degree for the vertices but also high __vertex‐degree__ (or __multiplicity

2-Connected Spanning Subgraphs of Planar
2-Connected Spanning Subgraphs of Planar 3-Connected Graphs
✍ D.W. Barnette πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 278 KB

We prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum valence 15 . We give an example of a planar 3 -connected graph with no spanning 2-connected subgraph of maximum valence five. i) 1994 Academic Press, Inc.