Abstract
In this paper, we show that every 3‐connected (3‐edge‐connected) planar graph contains a 2‐connected (respectively, 2‐edge‐connected) spanning partial 2‐tree (series‐parallel) graph. In contrast, a recent result implies that not all 3‐connected graphs contain 2‐edge‐connected series‐parallel spanning subgraphs.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 607-614 |
| Number of pages | 8 |
| Journal | Networks |
| Volume | 22 |
| Issue number | 6 |
| DOIs | |
| State | Published - Oct 1992 |
| Externally published | Yes |
ASJC Scopus subject areas
- Software
- Information Systems
- Hardware and Architecture
- Computer Networks and Communications