Paths through K-specified edges in a linear graph (Q690196): Difference between revisions

Let \(G\) be a simple, connected and undirected graph, let \(K\) be a set of edges of \(G\), and let \(s\) and \(d\) be two different vertices of \(G\). This paper gives an algorithm to find all paths in \(G\) from \(s\) to \(d\), whose edge-set contains \(K\). The result is based on the fact that, if \(P\) is such a path, the remaining ones take the form \(P \oplus E\), where \(E\) is an Eulerian graph.