Name
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. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1002/net.3230220608 | NETWORKS |
Keywords | Field | DocType |
series parallel,planar graph,connected graph | Discrete mathematics,Combinatorics,Comparability graph,Outerplanar graph,Forbidden graph characterization,Book embedding,Cograph,Universal graph,Mathematics,Planar graph,Split graph | Journal |
Volume | Issue | ISSN |
22 | 6 | 0028-3045 |
Citations | PageRank | References |
4 | 0.68 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ehab S. Elmallah | 1 | 105 | 19.29 |
| Charles J. Colbourn | 2 | 2726 | 290.04 |