๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On Small Contractible Subgraphs in 3-connected Graphs of Small Average Degree

โœ Scribed by Matthias Kriesell


Book ID
106047694
Publisher
Springer Japan
Year
2007
Tongue
English
Weight
263 KB
Volume
23
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Connected subgraphs with small degree su
โœ Enomoto, Hikoe; Ota, Katsuhiro ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 213 KB ๐Ÿ‘ 2 views

It is well-known that every planar graph has a vertex of degree at most five. Kotzig proved that every 3-connected planar graph has an edge xy such that deg(x) + deg(y) โ‰ค 13. In this article, considering a similar problem for the case of three or more vertices that induce a connected subgraph, we sh

Long Cycles and 3-Connected Spanning Sub
โœ 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