A Note on the Recognition of Nested Graphs

DOI10.1007/978-3-642-02029-2_4zbMath1194.05150OpenAlexW1534284488MaRDI QIDQ3655137

Mark Korenblit, Vadim E. Levit

Publication date: 7 January 2010

Published in: Graph Theory, Computational Intelligence and Thought (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02029-2_4

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Computing Network Reliability in Time Polynomial in the Number of Cuts
• Nested Graphs
• Forbidden subgraphs and graph decomposition
• The Recognition of Series Parallel Digraphs
• Optimal Reduction of Two-Terminal Directed Acyclic Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Note on the Recognition of Nested Graphs