Paths and circuits in partially directed graphs (Q1296988)

The authors examine the validity of known results on Eulerian circuits and edge coverings if the graphs are taken to have both directed and undirected edges. Necessary and sufficient conditions are given (1) for an Eulerian path to exist in such a graph when there are two odd vertices; (2) for the edges of such a graph to be covered by no more than \(n\) edge disjoint paths, or for the graph to be Eulerian, in the case where every vertex of \(G\) is even.