Graphs inducing totally balanced and submodular Chinese postman games

M. Josune Albizuri, H.J.M. Hamers

Research output: Contribution to journalArticleScientificpeer-review

1 Citation (Scopus)

Abstract

A Chinese postman (CP) game is induced by a weighted undirected, connected graph in which the edges are identified as players and a vertex is chosen as post-office location.

Granot and Granot (2012) characterized graphs that give rise to CP games that are balanced. This note completes this line of research by characterizing graphs that give rise to CP games that are submodular (totally balanced, respectively).
Original languageEnglish
Pages (from-to)98-103
JournalDiscrete Applied Mathematics
Volume172
DOIs
Publication statusPublished - 31 Jul 2014

Keywords

  • Chinese Postman games
  • submodularity
  • totally balancedness

Fingerprint Dive into the research topics of 'Graphs inducing totally balanced and submodular Chinese postman games'. Together they form a unique fingerprint.

  • Cite this