#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2001

2017

- This year (3)
- Last 5 years (17)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Liliana Alcón, Marisa Gutierrez
- Discrete Applied Mathematics
- 2004

By generalizing the idea of extended triangle of a graph, we succeed in obtaining a common framework for the result of Roberts and Spencer about clique graphs and the one of Szwarc4ter about Helly graphs. We characterize Helly and 3-Helly planar graphs using extended triangles. We prove that if a planar graph G is a clique graph, then every extended… (More)

- Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez
- Theor. Comput. Sci.
- 2009

A complete set of a graph G is a subset of vertices inducing a complete subgraph. A clique is a maximal complete set. Denote by C(G) the clique family of G. The clique graph of G, denoted by K(G), is the intersection graph of C(G). Say that G is a clique graph if there exists a graph H such that G = K(H). The clique graph recognition problem asks whether a… (More)

- Liliana Alcón
- Discrete Applied Mathematics
- 2006

The clique graph of G, K(G), is the intersection graph of the family of cliques (maximal complete sets) of G. Clique-critical graphs were defined as those whose clique graph changes whenever a vertex is removed. We prove that if G has m edges then any clique-critical graph in K−1(G) has at most 2m vertices, which solves a question posed by Escalante and… (More)

- Liliana Alcón, Marisa Gutierrez, Glenn H. Hurlbert
- SIAM J. Discrete Math.
- 2014

Finding the pebbling number of a graph is harder than NP-complete (Π 2 complete, to be precise). However, for many families of graphs there are formulas or polynomial algorithms for computing pebbling numbers; for example, complete graphs, products of paths (including cubes), trees, cycles, diameter two graphs, and more. Moreover, graphs having minimum… (More)

- Liliana Alcón, Marisa Gutierrez, María Pía Mazzoleni
- Discrete Applied Mathematics
- 2014

- Liliana Alcón, Flavia Bonomo, +4 authors Mario Valencia-Pabon
- Electronic Notes in Discrete Mathematics
- 2015

Golumbic, Lipshteyn and Stern proved that every graph can be represented as the edge intersection graph of paths on a grid, i.e., one can associate to each vertex of E-mail addresses: liliana@mate.unlp.edu.ar; fbonomo@dc.uba.ar; gduran@dm.uba.ar; marisa@mate.unlp.edu.ar; pia@mate.unlp.edu.ar; bernard.ries@dauphine.fr; valencia@lipn.univ-paris13.fr. This… (More)

- Liliana Alcón, Márcia R. Cerioli, Celina M. H. de Figueiredo, Marisa Gutierrez, João Meidanis
- Discrete Applied Mathematics
- 2004

- Liliana Alcón, Boštjan Brešarb, +4 authors Aleksandra Tepeh
- 2014

A walk W between two non-adjacent vertices in a graph G is called tolled if the first vertex of W is among vertices from W adjacent only to the second vertex ofW , and the last vertex ofW is among vertices fromW adjacent only to the second-last vertex of W . In the resulting interval convexity, a set S ⊂ V (G) is toll convex if for any two non-adjacent… (More)

- Liliana Alcón, Bostjan Bresar, +4 authors Aleksandra Tepeh
- Eur. J. Comb.
- 2015