A graph theoretical model for the total balancedness of combinatorial games. M.

• V. Leoni Escalante ^[1] ; G. Nasini ^[1]
  1. [1] Universidad Nacional de Rosario

     Universidad Nacional de Rosario

     Argentina

     
• Localización: Revista de la Unión Matemática Argentina, ISSN 0041-6932, ISSN-e 1669-9637, Vol. 53, Nº. 1, 2012, págs. 85-92
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • In this paper we present a model for the study of the total balancedness of packing and covering games, concerning some aspects of graph theory. We give an alternative proof of van Velzen’s characterization of totally balanced covering games. We introduce new types of graph perfection, which allows us to give another approach to the open problem of characterizing totally balanced packing games.