Mercè Mora

According to our database, Mercè Mora authored at least 43 papers between 1997 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Graphs with isolation number equal to one third of the order.

Magdalena Lemanska, Mercè Mora, María José Souto Salorio

Discret. Math., 2024

2023

Elimination properties for minimal dominating sets of graphs.

Jaume Martí-Farré, Mercè Mora, María Luz Puertas, José Luis Ruiz

Discuss. Math. Graph Theory, 2023

The neighbor-locating-chromatic number of trees and unicyclic graphs.

Liliana Alcón, Marisa Gutierrez, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo

Discuss. Math. Graph Theory, 2023

2022

Trees whose even-degree vertices induce a path are antimagic.

Antoni Lozano, Mercè Mora, Carlos Seara, Joaquín Tey

Discuss. Math. Graph Theory, 2022

2021

Total domination in plane triangulations.

Mercè Claverol, Alfredo García, Carlos G. Hernández, Carmen Hernando, Montserrat Maureso, Mercè Mora, Javier Tejel

Discret. Math., 2021

2020

Neighbor-locating colorings in graphs.

Liliana Alcón, Marisa Gutierrez, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo

Theor. Comput. Sci., 2020

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

Lluís Alemany-Puig, Mercè Mora, Ramon Ferrer-i-Cancho

CoRR, 2020

2019

Uniform clutters and dominating sets of graphs.

Jaume Martí-Farré, Mercè Mora, José Luis Ruiz

Discret. Appl. Math., 2019

Resolving dominating partitions in graphs.

Carmen Hernando, Mercè Mora, Ignacio M. Pelayo

Discret. Appl. Math., 2019

Locating domination in bipartite graphs and their complements.

Carmen Hernando, M. Mora, Ignacio M. Pelayo

Discret. Appl. Math., 2019

Antimagic labelings of caterpillars.

Antoni Lozano, Mercè Mora, Carlos Seara

Appl. Math. Comput., 2019

2018

Neighbor-locating coloring: graph operations and extremal cardinalities.

Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Liliana Alcón, Marisa Gutierrez

Electron. Notes Discret. Math., 2018

General bounds on limited broadcast domination.

José Cáceres, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas

Discret. Math. Theor. Comput. Sci., 2018

Metric-locating-dominating sets of graphs for constructing related subsets of vertices.

Antonio González, Carmen Hernando, Mercè Mora

Appl. Math. Comput., 2018

2017

Distance 2-domination in prisms of graphs.

Ferran Hurtado, Mercè Mora, Eduardo Rivera-Campo, Rita Zuazua

Discuss. Math. Graph Theory, 2017

2015

Completion and decomposition of hypergraphs into dominating sets of graphs.

Jaume Martí-Farré, Mercè Mora, José Luis Ruiz

Electron. Notes Discret. Math., 2015

Quasiperfect Domination in Trees.

José Cáceres, María Luz Puertas, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo

Electron. Notes Discret. Math., 2015

On global location-domination in graphs.

Carmen Hernando, Mercè Mora, Ignacio M. Pelayo

Ars Math. Contemp., 2015

2014

LD-graphs and global location-domination in bipartite graphs.

Carmen Hernando, M. Mora, Ignacio M. Pelayo

Electron. Notes Discret. Math., 2014

The graph distance game and some graph operations.

José Cáceres, María Luz Puertas, Carmen Hernando, M. Mora, Ignacio M. Pelayo

Electron. Notes Discret. Math., 2014

Nordhaus-Gaddum bounds for locating domination.

Carmen Hernando, M. Mora, Ignacio M. Pelayo

Eur. J. Comb., 2014

2013

Some structural, metric and convex properties of the boundary of a graph.

M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara

Ars Comb., 2013

Locating-dominating codes: Bounds and extremal cardinalities.

José Cáceres, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas

Appl. Math. Comput., 2013

2012

On the metric dimension of infinite graphs.

José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas

Discret. Appl. Math., 2012

Distinguishing Trees in Linear Time.

Carlos Seara, Antoni Lozano, Mercè Mora

Electron. J. Comb., 2012

2011

On Computing Enclosing Isosceles Triangles and Related Problems.

Prosenjit Bose, Mercè Mora, Carlos Seara, Saurabh Sethia

Int. J. Comput. Geom. Appl., 2011

Fitting a two-joint orthogonal chain to a point set.

José Miguel Díaz-Báñez, Mario Alberto López, Mercè Mora, Carlos Seara, Inmaculada Ventura

Comput. Geom., 2011

2010

On the geodetic and the hull numbers in strong product graphs.

José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas

Comput. Math. Appl., 2010

2008

Geodeticity of the contour of chordal graphs.

José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas, Carlos Seara

Discret. Appl. Math., 2008

2007

On the Metric Dimension of Cartesian Products of Graphs.

José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas, Carlos Seara, David R. Wood

SIAM J. Discret. Math., 2007

Extremal Graph Theory for Metric Dimension and Diameter.

M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara, David R. Wood

Electron. Notes Discret. Math., 2007

2006

On geodetic sets formed by boundary vertices.

José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas, Carlos Seara

Discret. Math., 2006

2005

On the metric dimension of some families of graphs.

M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara, José Cáceres, María Luz Puertas

Electron. Notes Discret. Math., 2005

Searching for geodetic boundary vertex sets.

José Cáceres, María Luz Puertas, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara

Electron. Notes Discret. Math., 2005

De Bruijn and Kautz digraphs of a rooted tree.

José Luis Ruiz, Mercè Mora

Discret. Math., 2005

On the Steiner, geodetic and hull numbers of graphs.

M. Carmen Hernando, Tao Jiang, Mercè Mora, Ignacio M. Pelayo, Carlos Seara

Discret. Math., 2005

2004

Separability by two lines and by nearly straight polygonal chains.

Ferran Hurtado, Mercè Mora, Pedro A. Ramos, Carlos Seara

Discret. Appl. Math., 2004

2002

Splitting a Delaunay Triangulation in Linear Time.

Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, Monique Teillaud

Algorithmica, 2002

2001

Separating several point sets in the plane.

Olivier Devillers, Ferran Hurtado, Mercè Mora, Carlos Seara

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

1999

Endo-circulant digraphs: connectivity and generalized cycles.

Josep M. Brunat, Montserrat Maureso, M. Mora

Discret. Math., 1999

Geometric Tree Graphs of Points in Convex Position.

M. Carmen Hernando, Ferran Hurtado, Alberto Márquez, Mercè Mora, Marc Noy

Discret. Appl. Math., 1999

1998

Geometric tree graphs of points in the plane.

M. Carmen Hernando, Ferran Hurtado, Alberto Márquez, Mercè Mora, Marc Noy

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997

Characterization of c-circulant digraphs of degree two which are circulant.

Josep M. Brunat, Montserrat Maureso, M. Mora

Discret. Math., 1997