Mercè Mora

According to our database1, Mercè Mora authored at least 39 papers between 1997 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Total domination in plane triangulations.
Discret. Math., 2021

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

Reappraising the distribution of the number of edge crossings of graphs on a sphere.
CoRR, 2020

2019
Uniform clutters and dominating sets of graphs.
Discret. Appl. Math., 2019

Resolving dominating partitions in graphs.
Discret. Appl. Math., 2019

Locating domination in bipartite graphs and their complements.
Discret. Appl. Math., 2019

Antimagic labelings of caterpillars.
Appl. Math. Comput., 2019

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

General bounds on limited broadcast domination.
Discret. Math. Theor. Comput. Sci., 2018

Metric-locating-dominating sets of graphs for constructing related subsets of vertices.
Appl. Math. Comput., 2018

2017
Distance 2-domination in prisms of graphs.
Discuss. Math. Graph Theory, 2017

2015
Completion and decomposition of hypergraphs into dominating sets of graphs.
Electron. Notes Discret. Math., 2015

Quasiperfect Domination in Trees.
Electron. Notes Discret. Math., 2015

On global location-domination in graphs.
Ars Math. Contemp., 2015

2014
LD-graphs and global location-domination in bipartite graphs.
Electron. Notes Discret. Math., 2014

The graph distance game and some graph operations.
Electron. Notes Discret. Math., 2014

Nordhaus-Gaddum bounds for locating domination.
Eur. J. Comb., 2014

2013
Locating-dominating codes: Bounds and extremal cardinalities.
Appl. Math. Comput., 2013

2012
Distinguishing Trees in Linear Time.
Electron. J. Comb., 2012

2011
On Computing Enclosing Isosceles Triangles and Related Problems.
Int. J. Comput. Geom. Appl., 2011

Fitting a two-joint orthogonal chain to a point set.
Comput. Geom., 2011

2010
On the geodetic and the hull numbers in strong product graphs.
Comput. Math. Appl., 2010

2009
On the Metric Dimension of Infinite Graphs.
Electron. Notes Discret. Math., 2009

2008
Geodeticity of the contour of chordal graphs.
Discret. Appl. Math., 2008

2007
On the Metric Dimension of Cartesian Products of Graphs.
SIAM J. Discret. Math., 2007

Extremal Graph Theory for Metric Dimension and Diameter.
Electron. Notes Discret. Math., 2007

2006
Some structural, metric and convex properties on the boundary of a graph.
Electron. Notes Discret. Math., 2006

On geodetic sets formed by boundary vertices.
Discret. Math., 2006

2005
On the metric dimension of some families of graphs.
Electron. Notes Discret. Math., 2005

Searching for geodetic boundary vertex sets.
Electron. Notes Discret. Math., 2005

De Bruijn and Kautz digraphs of a rooted tree.
Discret. Math., 2005

On the Steiner, geodetic and hull numbers of graphs.
Discret. Math., 2005

2004
Separability by two lines and by nearly straight polygonal chains.
Discret. Appl. Math., 2004

2002
Splitting a Delaunay Triangulation in Linear Time.
Algorithmica, 2002

2001
Separating several point sets in the plane.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

1999
Endo-circulant digraphs: connectivity and generalized cycles.
Discret. Math., 1999

Geometric Tree Graphs of Points in Convex Position.
Discret. Appl. Math., 1999

1998
Geometric tree graphs of points in the plane.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Characterization of c-circulant digraphs of degree two which are circulant.
Discret. Math., 1997


  Loading...