Coherent orientations and series-parallel networks

✍ Scribed by Ottavio D'Antona; Joseph P.S. Kung

• Publisher: Elsevier Science
• Year: 1980
• Tongue: English
• Weight: 330 KB
• Volume: 32
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/0012-365x(80)90106-5

✦ Synopsis

Let p be an edge of the graph G. An orientation of G is p-coherent if the set of directed circuits is exactly the set of circuits containing the edge p. Theorm: A matroidally connected graph G is a series-parallel network if and only if for every edge p of G, there exists a p-coherent orientation.