1 citations · 2 across the 5 of their papers we have counts for
6 papers
On dually-CPT and strong-CPT posets
Liliana Alcón, Martin Charles Golumbic, Noemí Gudiño +2
A poset is a containment of paths in a tree (CPT) if it admits a representation by containment where each element of the poset is represented by a path in a tree and two elements a…
Pebbling in Powers of Paths
Liliana Alcón, Glenn Hurlbert
The -fold pebbling number, , of a graph is defined to be the minimum number so that, from any given configuration of pebbles on the vertices of , it is po…
On -EPG and EPT graphs
Liliana Alcón, María Pía Mazzoleni, Tanilson Dias dos Santos
This research contains as a main result the prove that every Chordal -EPG graph is simultaneously in the graph classes VPT and EPT. In addition, we describe structures that mu…
-Pebbling in -connected diameter two graphs
Liliana Alcón, Marisa Gutierrez, Glenn Hurlbert
Graph pebbling models the transportation of consumable resources. As two pebbles move across an edge, one reaches its destination while the other is consumed. The -pebbling numb…
Characterizing [h,2,1] graphs by minimal forbidden induced subgraphs
Liliana Alcón, Marisa Gutierrez, María Pía Mazzoleni
An undirected graph G is called a VPT graph if it is the vertex intersection graph of a family of paths in a tree. The class of graphs which admit a VPT representation in a host tr…
Recognizing [h,2,1] graphs
Liliana Alcón, Marisa Gutierrez, María Pía Mazzoleni
An (h,s,t)-representation of a graph G consists of a collection of subtrees of a tree T, where each subtree corresponds to a vertex of G such that (i) the maximum degree of T is at…