14 citations · 29 across the 6 of their papers we have counts for
5 papers · 1 filter
On some special classes of contact -VPG graphs
Flavia Bonomo-Braberman, María Pía Mazzoleni, Mariano Leonardo Rean +1
A graph is a -VPG graph if one can associate a path on a rectangular grid with each vertex such that two vertices are adjacent if and only if the corresponding paths inter…
Helly graphs on bounded degree trees: forbidden induced subgraphs and efficient recognition
Liliana Alcón, Marisa Gutierrez, María Pía Mazzoleni
The edge intersection graph of a family of paths in host tree is called an graph. When the host tree has maximum degree , we say that belongs to the class . I…
Clique coloring -EPG graphs
Flavia Bonomo, María Pía Mazzoleni, Maya Stein
We consider the problem of clique coloring, that is, coloring the vertices of a given graph such that no (maximal) clique of size at least two is monocolored. It is known that inte…
Vertex intersection graphs of paths on a grid: characterization within block graphs
L. Alcón, F. Bonomo, M. P. Mazzoleni
We investigate graphs that can be represented as vertex intersections of horizontal and vertical paths in a grid, the so called -VPG graphs. Recognizing this class is an NP-co…
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
L. Alcón, F. Bonomo, G. Durán +4
Golumbic, Lipshteyn and Stern \cite{Golumbic-epg} proved that every graph can be represented as the edge intersection graph of paths on a grid (EPG graph), i.e., one can associate…