Equistable series-parallel graphs

Ephraim Korach, Uri N. Peled

Research output: Contribution to journalConference articlepeer-review

11 Scopus citations


An equistable series-parallel graphs were characterized. A graph was called equistable when there was a non-negative weight function in its vertices such that a set S of vertices has total weight 1 if and only if S was maximal stable. The results of Mahadev et al. about equistable outer-planer graphs were also discussed.

Original languageEnglish
Pages (from-to)149-162
Number of pages14
JournalDiscrete Applied Mathematics
Issue number1-3
StatePublished - 15 Oct 2003
EventStability in Graphs and Related Topics - Lausanne, Switzerland
Duration: 1 Jul 20021 Jul 2002


  • Equistable graphs
  • Series-parallel graphs

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Equistable series-parallel graphs'. Together they form a unique fingerprint.

Cite this