Pages that link to "Item:Q5896103"
From MaRDI portal
The following pages link to Monitoring the edges of a graph using distances (Q5896103):
Displaying 16 items.
- On the parameterized complexity of the edge monitoring problem (Q509893) (← links)
- Edge monitoring problem on interval graphs (Q510622) (← links)
- Complexity of edge monitoring on some graph classes (Q2172388) (← links)
- Monitoring the edges of a graph using distances (Q5896103) (← links)
- (Q5918773) (redirect page) (← links)
- Monitoring edge-geodetic sets: hardness and graph products (Q6094715) (← links)
- Monitoring the edges of a graph using distances with given girth (Q6126478) (← links)
- On the distance-edge-monitoring numbers of graphs (Q6184320) (← links)
- Erdös-Gallai-type problems for distance-edge-monitoring numbers (Q6184335) (← links)
- Distance-edge-monitoring sets of networks (Q6541036) (← links)
- Distance-based covering problems for graphs of given cyclomatic number (Q6546588) (← links)
- Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity (Q6547818) (← links)
- Perturbation results for distance-edge-monitoring numbers (Q6593703) (← links)
- Monitoring the edges of product networks using distances (Q6655674) (← links)
- Realizability problem of distance-edge-monitoring numbers (Q6658853) (← links)
- Fault-tolerance in distance-edge-monitoring sets (Q6668144) (← links)