madhavamathcompetition.com
Basic Graph Theory Problem Set II for RMO and INMO
An Eulerian trail in a digraph is a trail containing all the edges. An Eulerian circuit is a closed trail containing all the edges. Show that a digraph X contains an Eulerian circuit if and only if…