Noun
Chinese postman problem (plural Chinese postman problems) (graph theory) The problem of finding the shortest closed path or circuit that visits every edge of a (connected) undirected graph.