Series‐parallel subgraphs of planar graphs

Ehab S. Elmallah, Charles J. Colbourn

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


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 languageEnglish (US)
Pages (from-to)607-614
Number of pages8
Issue number6
StatePublished - Oct 1992
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this