Liliana Alcón

Orcid: 0000-0002-0933-7385

According to our database1, Liliana Alcón authored at least 42 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Pebbling in powers of paths.
Discret. Math., May, 2023

Relationship among B<sub>1</sub>-EPG, VPT and EPT graphs classes.
Discuss. Math. Graph Theory, 2023

The neighbor-locating-chromatic number of trees and unicyclic graphs.
Discuss. Math. Graph Theory, 2023

2022
On dually-CPT and strong-CPT posets.
CoRR, 2022

2021
On k-tree Containment Graphs of Paths in a Tree.
Order, 2021

2020
Neighbor-locating colorings in graphs.
Theor. Comput. Sci., 2020

On clique-inverse graphs of graphs with bounded clique number.
J. Graph Theory, 2020

Two infinite families of critical clique-Helly graphs.
Discret. Appl. Math., 2020

On B<sub>1</sub>-EPG and EPT graphs.
CoRR, 2020

2019
A Characterization of Claw-free CIS Graphs and New Results on the Order of CIS Graphs.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018
Neighbor-locating coloring: graph operations and extremal cardinalities.
Electron. Notes Discret. Math., 2018

Recent results on containment graphs of paths in a tree.
Discret. Appl. Math., 2018

On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid.
Discret. Appl. Math., 2018

2017
Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs.
Graphs Comb., 2017

On the Existence of Critical Clique-Helly Graphs.
Electron. Notes Discret. Math., 2017

Helly EPT graphs on bounded degree trees: Characterization and recognition.
Discret. Math., 2017

Pebbling in semi-2-trees.
Discret. Math., 2017

2016
A note on path domination.
Discuss. Math. Graph Theory, 2016

Strong cliques and equistability of EPT graphs.
Discret. Appl. Math., 2016

Helly <i>EPT</i> graphs on bounded degree trees: forbidden induced subgraphs and efficient recognition.
CoRR, 2016

2015
Pebbling in 2-Paths.
Electron. Notes Discret. Math., 2015

On containment graphs of paths in a tree.
Electron. Notes Discret. Math., 2015

Toll convexity.
Eur. J. Comb., 2015

Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs.
Discret. Math., 2015

2014
Pebbling in Split Graphs.
SIAM J. Discret. Math., 2014

Recognizing vertex intersection graphs of paths on bounded degree trees.
Discret. Appl. Math., 2014

On asteroidal sets in chordal graphs.
Discret. Appl. Math., 2014

2013
Split clique graph complexity.
Theor. Comput. Sci., 2013

On minimal non [h, 2, 1] graphs.
Electron. Notes Discret. Math., 2013

2012
Finding intersection models: From chordal to Helly circular-arc graphs.
Discret. Math., 2012

2011
Non-separating cliques, asteroidal number and leafage. The minimal 4-asteroidal split graphs.
Electron. Notes Discret. Math., 2011

2010
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs.
Discret. Appl. Math., 2010

2009
The complexity of clique graph recognition.
Theor. Comput. Sci., 2009

2007
Tree loop graphs.
Discret. Appl. Math., 2007

2006
Clique-critical graphs: Maximum size and recognition.
Discret. Appl. Math., 2006

Clique Graph Recognition Is NP-Complete.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

2005
Non loop graphs with induced cycles.
Electron. Notes Discret. Math., 2005

Loop Graphs and Asteroidal Sets.
Electron. Notes Discret. Math., 2005

2004
Clique-Critical Graphs.
Electron. Notes Discret. Math., 2004

Cliques and extended triangles. A necessary condition for planar clique graphs.
Discret. Appl. Math., 2004

Clique Graphs of Planar Graphs.
Ars Comb., 2004

2001
Clique Planar Graphs.
Electron. Notes Discret. Math., 2001


  Loading...