In this document, we study the scope of the following graph model: each vertex is assigned to a box in Rd and to a representative element that belongs to that box. Two vertices are connected by an edge if and only if its ...

Golumbic, Lipshteyn and Stern [12] proved that every graph can be represented as the edge intersection graph of paths on a grid (EPG graph), i.e., one can associate with each vertex of the graph a nontrivial path on a ...

We investigate graphs that can be represented as vertex intersections of horizontal and vertical paths in a grid, the so called B0-VPG graphs. Recognizing this class is an NP-complete problem. Although, there exists a ...