On the equivalence between some local and global Chinese postman and traveling salesman graphs

Edmonds, 1973, Matching, Euler tours and the Chinese postman, Math. Programming, 5, 88, 10.1007/BF01580113 Granot, 2000, Naturally submodular digraphs and forbidden digraph configurations, Discrete Appl. Math., 100, 67, 10.1016/S0166-218X(99)00167-5 Granot, 1999, On some balanced, totally balanced and submodular delivery games, Math. Programming, 86, 355, 10.1007/s101070050093 Hamers, 1999, Cost allocation in the Chinese postman problem, Eur. J. Oper. Res., 118, 153, 10.1016/S0377-2217(98)00310-5 Herer, 1995, Characterization of naturally submodular graphs, Proc. Amer. Math. Soc., 123, 613 Ichiishi, 1981, Super-modularity, J. Econom. Theory, 25, 283, 10.1016/0022-0531(81)90007-7 J. Kuipers, A polynomial time algorithm for computing the nucleolus of convex games, Research Memorandum 96-12, Department of Mathematics, University of Maastricht, The Netherlands, 1996. E. Lawler, J.K. Lenstra, A. Rinnooy Kan, D. Shmoys (Eds.), The Traveling Salesman Problem, Wiley, UK, 1989. Maschler, 1972, The kernel and bargaining set of convex games, Internat. J. Game Theory, 2, 73 Potters, 1992, Traveling salesman games, Math. Programming, 53, 199, 10.1007/BF01585702 Shapley, 1971, Cores of convex games, Internat. J. Game Theory, 1, 11, 10.1007/BF01753431 Tamir, 1989, On the core of a traveling salesman cost allocation game, Oper. Res. Lett., 8, 31, 10.1016/0167-6377(89)90030-8 Tijs, 1981, Bounds for the core and the τ-value, 123