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
โฆ 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
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
Construction of a family of graphs with
โ
Sul-young Choi; Puhua Guan
๐
Article
๐
2007
๐
Elsevier Science
๐
English
โ 123 KB
Ends and Vertices of Small Degree in Inf
โ
Stein, Maya
๐
Article
๐
2010
๐
Society for Industrial and Applied Mathematics
๐
English
โ 321 KB
A Practical Treatise on Small-pox. Illus
๐
Article
๐
1901
๐
Elsevier Science
๐
English
โ 187 KB
MAGNA CARTAThe Great CharterPreamble
๐
Fiction
๐
English
โ 11 KB
๐ 18 views