  The class of Parikh word representable graphs were recently introduced. In
this work, we further develop its general theory beyond the binary alphabet.
Our main result shows that this class is equivalent to the class of bipartite
permutation graphs. Furthermore, we study certain graph theoretic properties of
these graphs in terms of the arity of the representing word.
