Text this: NP-completeness of the Eulerian walk problem for a multiple graph