Chinese Postman Problem on edge-colored multigraphs

Download PDF
Open Webpage

Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo

Published: 01 Jan 2017, Last Modified: 05 Feb 2025Discret. Appl. Math. 2017EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: It is well-known that the Chinese Postman Problem on undirected and directed graphs is polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in sharp contrast to the Chinese Postman Problem on mixed graphs, i.e., graphs with directed and undirected edges, for which the problem is NP-hard.