✦ LIBER ✦

2-Connected Spanning Subgraphs of Planar 3-Connected Graphs

✍ Scribed by D.W. Barnette

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 278 KB
Volume: 61
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1994.1045

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Connected Spanning Subgraphs of 3-Connec

Connected Spanning Subgraphs of 3-Connected Planar Graphs

✍ Hikoe Enomoto; Tadashi Iida; Katsuhiro Ota 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 339 KB

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

Connected subgraphs with small degree su

Connected subgraphs with small degree sums in 3-connected planar graphs

✍ 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

Contractible Subgraphs in 3-Connected Gr

Contractible Subgraphs in 3-Connected Graphs

✍ Matthias Kriesell 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 154 KB

A subgraph H of a 3-connected finite graph G is called contractible if H is connected and G&V(H) is 2-connected. This work is concerned with a conjecture of McCuaig and Ota which states that for any given k there exists an f (k) such that any 3-connected graph on at least f (k) vertices possesses a

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