Graphs are combinatorial structures given by a set of vertices and a set of edges giving the adjacencies between pairs of vertices. Drawing graphs nicely is a challenging task. If a graph has some particular structure it is often very useful to use the knowledge about this for visualizing the object. In many cases, there are polynomial time algorithms for recognition of product graphs and graph bundles. We provide several examples and give a short survey of results and open problems.