Graph Theory

Jun 2010

Problem F23: In any graph that contains a closed Euler path, is it possible to assign directions to the edges in such away that each vertex, the number of incoming edges equal the outgoing edges. Explain how this can be done using the Euler path.