13 citations · 19 across the 6 of their papers we have counts for
8 papers
The Neighbor-Locating-Chromatic Number of Pseudotrees
Liliana Alcon, Marisa Gutierrez, Carmen Hernando +2
A -coloring of a graph is a partition of the set of vertices of into independent sets, which are called colors. A -coloring is neighbor-locating if any two vertic…
A characterization of claw-free CIS graphs and new results on the order of CIS graphs
Liliana Alcón, Marisa Gutierrez, Martin Milanič
A graph is CIS if every maximal clique interesects every maximal stable set. Currently, no good characterization or recognition algorithm for the CIS graphs is known. We characteri…
Neighbor-Locating Colorings in Graphs
Liliana Alcon, Marisa Gutierrez, Carmen Hernando +2
A -coloring of a graph is a -partition of into independent sets, called \emph{colors}. A -coloring is called \emph{neighbor-locating} if…
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…
Pebbling in Semi-2-Trees
Liliana Alcón, Marisa Gutierrez, Glenn Hurlbert
Graph pebbling is a network model for transporting discrete resources that are consumed in transit. Deciding whether a given configuration on a particular graph can reach a specifi…
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…