Nested Graphs

Mark Korenblit, Vadim E. Levit

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


We define a two-terminal directed acyclic graph (st-dag) characterized by a special structure of its mincuts and call it a nested graph. It is proved that every nested graph is series-parallel as well. We show that an st-dag of order n has exactly n - 1 mincuts if and only if it is nested.

Original languageEnglish
Pages (from-to)93-99
Number of pages7
JournalElectronic Notes in Discrete Mathematics
StatePublished - 15 Jul 2006
Externally publishedYes


  • Mincut
  • directed acyclic graph
  • series-parallel graph


Dive into the research topics of 'Nested Graphs'. Together they form a unique fingerprint.

Cite this