#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2001

2017

- This year (2)
- Last 5 years (16)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn 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
- 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, Márcia R. Cerioli, Celina M. H. de Figueiredo, Marisa Gutierrez, João Meidanis
- Discrete Applied Mathematics
- 2004

- Liliana Alcón, Marisa Gutierrez, István Kovács, Martin Milanic, Romeo Rizzi
- Discrete Applied Mathematics
- 2016

- 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 the graph a nontrivial path on a grid such that two vertices are adjacent if and only if the corresponding paths share at least one edge of the grid. For a nonnegative integer k, B k-EPG graphs… (More)

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

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

Graph pebbling is a network optimization model for transporting discrete resources that are consumed in transit: the movement of two pebbles across an edge consumes one of the pebbles. The pebbling number of a graph is the fewest number of pebbles t so that, from any initial configuration of t pebbles on its vertices, one can place a pebble on any given… (More)

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

- Liliana Alcón
- Discussiones Mathematicae Graph Theory
- 2016