We discuss a general framework for studying X-graphs of Y-graphs ((X,Y)-graphs). Within this framework we summarize the state-of-the art and deal with some open problems. New combinatorial results are presented, both in terms of problem complexity bounds and in terms of efficient algorithm design.

We also present a general framework for the visualization of (X,Y)-graphs, and some user interaction primitives are proposed.