We study the extended Chinese postman (CP) cooperative game induced by a connected, weighted, undirected graph G, wherein a postman, starting from a post office location, needs to traverse all edges wherein players reside, before returning to the post-office. We characterize the graphs...