𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On 2-Connected Spanning Subgraphs with Bounded Degree inK1,r-Free Graphs

✍ Scribed by Roman Kužel; Jakub Teska

Publisher
Springer Japan
Year
2011
Tongue
English
Weight
236 KB
Volume
27
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Long Cycles and 3-Connected Spanning Sub
Long Cycles and 3-Connected Spanning Subgraphs of Bounded Degree in 3-Connected K1, d-Free Graphs
✍ B. Jackson; N.C. Wormald 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 238 KB

Let \(G\) be a 3-connected \(K_{1, d}\)-free graph on \(n\) vertices. We show that \(G\) contains a 3-connected spanning subgraph of maximum degree at most \(2 d-1\). Using an earlier result of ours, we deduce that \(G\) contains a cycle of length at least \(\frac{1}{2} n^{c}\) where \(c=\left(\log

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

On low bound of degree sequences of span
On low bound of degree sequences of spanning trees inK-edge-connected graphs
✍ Zhenhong, Liu; Baoguang, Xu 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 257 KB 👁 3 views

[•] is a lower integer form and α depends on k. We show that every k-edge-connected graph with k ≥ 2, has a d k -tree, and α = 1 for k = 2, α = 2 for k ≥ 3.