The following pages link to Mercè Mora (Q322228):
Displaying 50 items.
- (Q283708) (redirect page) (← links)
- LD-graphs and global location-domination in bipartite graphs (Q283710) (← links)
- Completion and decomposition of hypergraphs into dominating sets of graphs (Q322230) (← links)
- Quasiperfect domination in trees (Q324884) (← links)
- Distinguishing trees in linear time (Q426889) (← links)
- Distance 2-domination in prisms of graphs (Q521756) (← links)
- Fitting a two-joint orthogonal chain to a point set (Q617541) (← links)
- Locating-dominating codes: bounds and extremal cardinalities (Q902474) (← links)
- Geometric tree graphs of points in convex position (Q1289020) (← links)
- Endo-circulant digraphs: Connectivity and generalized cycles (Q1292822) (← links)
- Characterization of \(c\)-circulant digraphs of degree two which are circulant (Q1356734) (← links)
- (Q1779491) (redirect page) (← links)
- On the Steiner, geodetic and hull numbers of graphs (Q1779492) (← links)
- De Bruijn and Kautz digraphs of a rooted tree (Q1779501) (← links)
- Neighbor-locating coloring: graph operations and extremal cardinalities (Q1792080) (← links)
- Splitting a Delaunay triangulation in linear time (Q1849762) (← links)
- Separability by two lines and by nearly straight polygonal chains (Q1885815) (← links)
- Antimagic labelings of caterpillars (Q2008558) (← links)
- Resolving dominating partitions in graphs (Q2026342) (← links)
- Metric dimension of maximal outerplanar graphs (Q2045286) (← links)
- Elimination properties for minimal dominating sets of graphs (Q2107746) (← links)
- Trees whose even-degree vertices induce a path are antimagic (Q2151224) (← links)
- Resolving sets tolerant to failures in three-dimensional grids (Q2167827) (← links)
- Total domination in plane triangulations (Q2219969) (← links)
- Caterpillars are antimagic (Q2223075) (← links)
- Neighbor-locating colorings in graphs (Q2285128) (← links)
- Extremal graph theory for metric dimension and diameter (Q2380462) (← links)
- Locating domination in bipartite graphs and their complements (Q2420423) (← links)
- Uniform clutters and dominating sets of graphs (Q2420426) (← links)
- Nordhaus-Gaddum bounds for locating domination (Q2441609) (← links)
- On the metric dimension of infinite graphs (Q2840509) (← links)
- On global location-domination in graphs (Q2950079) (← links)
- ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS (Q3007722) (← links)
- On the metric dimension of some families of graphs (Q3439322) (← links)
- Some structural, metric and convex properties on the boundary of a graph (Q3439437) (← links)
- Extremal Graph Theory for Metric Dimension and Diameter (Q3503491) (← links)
- (Q3625873) (← links)
- General bounds on limited broadcast domination (Q4560266) (← links)
- (Q4796184) (← links)
- On perfect and quasiperfect dominations in graphs (Q5005483) (← links)
- Perfect and quasiperfect domination in trees (Q5279867) (← links)
- Independent [1,2]-number versus independent domination number (Q5382817) (← links)
- (Q5397275) (← links)
- (Q5506519) (← links)
- Reappraising the distribution of the number of edge crossings of graphs on a sphere (Q5856886) (← links)
- On the metric representation of the vertices of a graph (Q6056696) (← links)
- Graphs with isolation number equal to one third of the order (Q6204326) (← links)
- The Neighbor-Locating-Chromatic Number of Pseudotrees (Q6316336) (← links)
- Antimagic and product antimagic graphs with pendant edges (Q6533935) (← links)
- Upper bounds on isolation parameters (Q6741844) (← links)
