The following pages link to Gregorio Hernández (Q283689):
Displaying 20 items.
- Monitoring maximal outerplanar graphs (Q283691) (← links)
- Distance domination, guarding and covering of maximal outerplanar graphs (Q479016) (← links)
- Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs (Q510554) (← links)
- (Q844522) (redirect page) (← links)
- The embracing Voronoi diagram and closest embracing number (Q844526) (← links)
- Bipartite embeddings of trees in the plane (Q1296568) (← links)
- (Q1355194) (redirect page) (← links)
- A combinatorial property of convex sets (Q1355195) (← links)
- Combinatorial bounds on paired and multiple domination in triangulations (Q1792065) (← links)
- Metric dimension of maximal outerplanar graphs (Q2045286) (← links)
- Total domination in plane triangulations (Q2219969) (← links)
- Zero forcing in triangulations (Q2423536) (← links)
- Computing shortest heterochromatic monotone routes (Q2517794) (← links)
- (Q2816363) (← links)
- Cover contact graphs (Q2968088) (← links)
- (Q3371186) (← links)
- Connecting Red Cells in a Bicolour Voronoi Diagram (Q4899279) (← links)
- IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION (Q5300011) (← links)
- Cover Contact Graphs (Q5452221) (← links)
- Solving the Illumination Problem with Heuristics (Q5756190) (← links)
