𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On finding two-connected subgraphs in planar graphs

✍ Scribed by J.Scott Provan

Book ID
108410516
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
248 KB
Volume
20
Category
Article
ISSN
0167-6377

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.

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