A Nontrivial Connected Digraph
Prove that a nontrivial connected digraph D is Eulerian if and only if E(D) can be partitioned into subsets E_i , 1<=i<=k, where [E_i] is a cycle for each i. <= means less and equal. Please can you explain this step by step and can you draw a graph.