5 papers
A characterization of interval nest digraphs
Ayelén Alcantar, Flavia Bonomo, Guillermo Durán +1
A digraph consisting of a set of vertices and a set of arcs is called an interval digraph if there exists a family of closed intervals such that $uv…
On the thinness and proper thinness of a graph
Flavia Bonomo, Diego de Estrada
Graphs with bounded thinness were defined in 2007 as a generalization of interval graphs. In this paper we introduce the concept of proper thinness, such that graphs with bounded p…
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…
Domination parameters with number 2: interrelations and algorithmic consequences
Flavia Bonomo, Bostjan Bresar, Luciano N. Grippo +2
In this paper, we study the most basic domination invariants in graphs, in which number 2 is intrinsic part of their definitions. We classify them upon three criteria, two of which…
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…