Directed graphs represented with formal grammar

Question

Is it possible to represent arbitrary directed graphs (with labeled edges) with a formal grammar, for example a context-sensitive grammar? If it is possible, is there a proof where you can read this up?