Name
Abstract | ||
|---|---|---|
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. Theorem: 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. |
Year | DOI | Venue |
|---|---|---|
1980 | 10.1016/0012-365X(80)90106-5 | Discrete Mathematics |
Keywords | Field | DocType |
series parallel | Complete graph,Discrete mathematics,Combinatorics,Bound graph,Loop (graph theory),Edge cover,Transpose graph,Edge contraction,Robbins' theorem,Mathematics,Complement graph | Journal |
Volume | Issue | ISSN |
32 | 1 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.54 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ottavio D'Antona | 1 | 1 | 0.54 |
| Joseph P. S. Kung | 2 | 78 | 20.60 |