default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMercè Mora
Person information
- affiliation: Polytechnic University of Catalonia, Barcelona, Spain
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j43]Magdalena Lemanska
, Mercè Mora, María José Souto Salorio:
Graphs with isolation number equal to one third of the order. Discret. Math. 347(5): 113903 (2024)- 2023
- [j42]Jaume Martí-Farré, Mercè Mora, María Luz Puertas, José Luis Ruiz:
Elimination properties for minimal dominating sets of graphs. Discuss. Math. Graph Theory 43(1): 137-149 (2023) - [j41]Liliana Alcón, Marisa Gutierrez, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo:
The neighbor-locating-chromatic number of trees and unicyclic graphs. Discuss. Math. Graph Theory 43(3): 659-675 (2023) - 2022
- [j40]Antoni Lozano, Mercè Mora, Carlos Seara, Joaquín Tey:
Trees whose even-degree vertices induce a path are antimagic. Discuss. Math. Graph Theory 42(3): 959-966 (2022) - 2021
- [j39]Mercè Claverol, Alfredo García, Carlos G. Hernández, Carmen Hernando, Montserrat Maureso, Mercè Mora, Javier Tejel:
Total domination in plane triangulations. Discret. Math. 344(1): 112179 (2021) - 2020
- [j38]Liliana Alcón, Marisa Gutierrez, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo:
Neighbor-locating colorings in graphs. Theor. Comput. Sci. 806: 144-155 (2020) - [i3]Lluís Alemany-Puig, Mercè Mora, Ramon Ferrer-i-Cancho:
Reappraising the distribution of the number of edge crossings of graphs on a sphere. CoRR abs/2003.03353 (2020) - [i2]Mercè Claverol, Alfredo García, Carlos G. Hernández, Carmen Hernando, Montserrat Maureso, Mercè Mora, Javier Tejel:
Total domination in plane triangulations. CoRR abs/2011.04255 (2020)
2010 – 2019
- 2019
- [j37]Antoni Lozano, Mercè Mora, Carlos Seara:
Antimagic labelings of caterpillars. Appl. Math. Comput. 347: 734-740 (2019) - [j36]Carmen Hernando, M. Mora, Ignacio M. Pelayo:
Locating domination in bipartite graphs and their complements. Discret. Appl. Math. 263: 195-203 (2019) - [j35]Jaume Martí-Farré, Mercè Mora, José Luis Ruiz:
Uniform clutters and dominating sets of graphs. Discret. Appl. Math. 263: 220-233 (2019) - [j34]Carmen Hernando, Mercè Mora, Ignacio M. Pelayo:
Resolving dominating partitions in graphs. Discret. Appl. Math. 266: 237-251 (2019) - 2018
- [j33]Antonio González, Carmen Hernando, Mercè Mora:
Metric-locating-dominating sets of graphs for constructing related subsets of vertices. Appl. Math. Comput. 332: 449-456 (2018) - [j32]José Cáceres, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas:
General bounds on limited broadcast domination. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [j31]Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Liliana Alcón, Marisa Gutierrez:
Neighbor-locating coloring: graph operations and extremal cardinalities. Electron. Notes Discret. Math. 68: 131-136 (2018) - 2017
- [j30]Ferran Hurtado, Mercè Mora, Eduardo Rivera-Campo, Rita Zuazua:
Distance 2-domination in prisms of graphs. Discuss. Math. Graph Theory 37(2): 383-397 (2017) - 2015
- [j29]Carmen Hernando, Mercè Mora, Ignacio M. Pelayo:
On global location-domination in graphs. Ars Math. Contemp. 8(2): 365-379 (2015) - [j28]Jaume Martí-Farré, Mercè Mora, José Luis Ruiz:
Completion and decomposition of hypergraphs into dominating sets of graphs. Electron. Notes Discret. Math. 49: 213-220 (2015) - [j27]José Cáceres, María Luz Puertas, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo:
Quasiperfect Domination in Trees. Electron. Notes Discret. Math. 50: 439-444 (2015) - 2014
- [j26]Carmen Hernando, M. Mora, Ignacio M. Pelayo:
Nordhaus-Gaddum bounds for locating domination. Eur. J. Comb. 36: 1-6 (2014) - [j25]José Cáceres, María Luz Puertas, Carmen Hernando, M. Mora, Ignacio M. Pelayo:
The graph distance game and some graph operations. Electron. Notes Discret. Math. 46: 153-159 (2014) - [j24]Carmen Hernando, M. Mora, Ignacio M. Pelayo:
LD-graphs and global location-domination in bipartite graphs. Electron. Notes Discret. Math. 46: 225-232 (2014) - 2013
- [j23]José Cáceres, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas:
Locating-dominating codes: Bounds and extremal cardinalities. Appl. Math. Comput. 220: 38-45 (2013) - [j22]M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara:
Some structural, metric and convex properties of the boundary of a graph. Ars Comb. 109: 267-283 (2013) - 2012
- [j21]Carlos Seara, Antoni Lozano, Mercè Mora:
Distinguishing Trees in Linear Time. Electron. J. Comb. 19(2): 19 (2012) - [j20]José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas:
On the metric dimension of infinite graphs. Discret. Appl. Math. 160(18): 2618-2626 (2012) - [i1]José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas:
Locating dominating codes: Bounds and extremal cardinalities. CoRR abs/1205.2177 (2012) - 2011
- [j19]José Miguel Díaz-Báñez, Mario Alberto López, Mercè Mora, Carlos Seara, Inmaculada Ventura:
Fitting a two-joint orthogonal chain to a point set. Comput. Geom. 44(3): 135-147 (2011) - [j18]Prosenjit Bose, Mercè Mora, Carlos Seara, Saurabh Sethia:
On Computing Enclosing Isosceles Triangles and Related Problems. Int. J. Comput. Geom. Appl. 21(1): 25-45 (2011) - 2010
- [j17]José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas:
On the geodetic and the hull numbers in strong product graphs. Comput. Math. Appl. 60(11): 3020-3031 (2010) - [j16]M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara, David R. Wood:
Extremal Graph Theory for Metric Dimension and Diameter. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j15]José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas:
On the Metric Dimension of Infinite Graphs. Electron. Notes Discret. Math. 35: 15-20 (2009) - 2008
- [j14]José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas, Carlos Seara:
Geodeticity of the contour of chordal graphs. Discret. Appl. Math. 156(7): 1132-1142 (2008) - 2007
- [j13]M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara, David R. Wood:
Extremal Graph Theory for Metric Dimension and Diameter. Electron. Notes Discret. Math. 29: 339-343 (2007) - [j12]José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas, Carlos Seara, David R. Wood:
On the Metric Dimension of Cartesian Products of Graphs. SIAM J. Discret. Math. 21(2): 423-441 (2007) - 2006
- [j11]José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas, Carlos Seara:
On geodetic sets formed by boundary vertices. Discret. Math. 306(2): 188-198 (2006) - [j10]M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara:
Some structural, metric and convex properties on the boundary of a graph. Electron. Notes Discret. Math. 24: 203-209 (2006) - 2005
- [j9]M. Carmen Hernando, Tao Jiang, Mercè Mora, Ignacio M. Pelayo, Carlos Seara:
On the Steiner, geodetic and hull numbers of graphs. Discret. Math. 293(1-3): 139-154 (2005) - [j8]José Luis Ruiz, Mercè Mora:
De Bruijn and Kautz digraphs of a rooted tree. Discret. Math. 293(1-3): 219-236 (2005) - [j7]José Cáceres, María Luz Puertas, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara:
Searching for geodetic boundary vertex sets. Electron. Notes Discret. Math. 19: 25-31 (2005) - [j6]M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara, José Cáceres, María Luz Puertas:
On the metric dimension of some families of graphs. Electron. Notes Discret. Math. 22: 129-133 (2005) - 2004
- [j5]Ferran Hurtado, Mercè Mora, Pedro A. Ramos, Carlos Seara:
Separability by two lines and by nearly straight polygonal chains. Discret. Appl. Math. 144(1-2): 110-122 (2004) - 2002
- [j4]Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, Monique Teillaud:
Splitting a Delaunay Triangulation in Linear Time. Algorithmica 34(1): 39-46 (2002) - 2001
- [c3]Olivier Devillers, Ferran Hurtado, Mercè Mora, Carlos Seara:
Separating several point sets in the plane. CCCG 2001: 81-84 - [c2]Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, Monique Teillaud:
Splitting a Delaunay Triangulation in Linear Time. ESA 2001: 312-320
1990 – 1999
- 1999
- [j3]M. Carmen Hernando, Ferran Hurtado, Alberto Márquez, Mercè Mora, Marc Noy:
Geometric Tree Graphs of Points in Convex Position. Discret. Appl. Math. 93(1): 51-66 (1999) - [j2]Josep M. Brunat, Montserrat Maureso, M. Mora:
Endo-circulant digraphs: connectivity and generalized cycles. Discret. Math. 197-198: 157-167 (1999) - 1998
- [c1]M. Carmen Hernando, Ferran Hurtado, Alberto Márquez, Mercè Mora, Marc Noy:
Geometric tree graphs of points in the plane. CCCG 1998 - 1997
- [j1]Josep M. Brunat, Montserrat Maureso, M. Mora:
Characterization of c-circulant digraphs of degree two which are circulant. Discret. Math. 165-166: 125-137 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
