Paths and circuits in partially directed graphs

Abstract Although questions about Eulerian circuits, paths, and covering edges by edge disjoint paths are easily answered for graphs or directed graphs, they are not easily answered if some edges are directed and others are not. We give necessary and sufficient conditions for an Eulerian path or circuit, and a necessary and sufficient condition for covering the edges by n edge disjoint paths when every vertex has even degree.