𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Spanning subgraphs of k-connected digraphs

✍ Scribed by Daniel A Marcus

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
600 KB
Volume
30
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.

Spanning even subgraphs of 3-edge-connec
Spanning even subgraphs of 3-edge-connected graphs
✍ Bill Jackson; Kiyoshi Yoshimoto πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 344 KB

## Abstract By Petersen's theorem, a bridgeless cubic graph has a 2‐factor. H. Fleischner extended this result to bridgeless graphs of minimum degree at least three by showing that every such graph has a spanning even subgraph. Our main result is that, under the stronger hypothesis of 3‐edge‐connec

On 2-Connected Spanning Subgraphs with L
On 2-Connected Spanning Subgraphs with Low Maximum Degree
✍ Daniel P Sanders; Yue Zhao πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 408 KB

Given a graph G, let a k-trestle of G be a 2-connected spanning subgraph of G of maximum degree at most k. Also, let /(G) be the Euler characteristic of G. This paper shows that every 3-connected graph G has a (10&2/(G))-trestle. If /(G) &5, this is improved to 8&2/(G), and for /(G) &10, this is fur