Coherent orientations and series-parallel networks

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.