Series-parallel subgraphs of planar graphs

@article{Elmallah1992SeriesparallelSO,
  title={Series-parallel subgraphs of planar graphs},
  author={Ehab S. Elmallah and Charles J. Colbourn},
  journal={Networks},
  year={1992},
  volume={22},
  pages={607-614}
}
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 (seriesparallel) graph. In contrast, a recent result by [4] implies that not all 3-connected graphs contain 2-edge-connected series-parallel spanning subgraphs. 

From This Paper

Topics from this paper.
4 Citations
4 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-4 of 4 references

The Complexity of Some Edge-Deletions Problems

  • E. Elmallah, C. Colbourn
  • IEEE Transactions on Circuits and Systems 35
  • 1988
1 Excerpt

Similar Papers

Loading similar papers…