Given a Chinese postman problem, delete all nodes of even degree together with all their incident arcs. Find a perfect matching of minimum cost in the remaining graph. Create an expanded version of the original problem's graph by adding an extra copy of each arc of the minimum cost matching. Show that an Euler cycle of the expanded graph is an optimal solution to the Chinese postman problem.