  We consider graphical games as introduced by Kearns et al. (2001). First we
analyse the interaction of graphicality with a notion of strategic equivalence
of games, providing a minimal complexity graphical description for games. Then
we study the interplay between graphicality and the classical decomposition of
games proposed by Candogan et al. (2011), characterizing the graphical
properties of each part of the decomposition.
