The following pages link to (Q3089301):
Displaying 18 items.
- Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
- Locating-dominating codes: bounds and extremal cardinalities (Q902474) (← links)
- A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes (Q1025490) (← links)
- An axiomatic characterization of some locations in trees (Q1266519) (← links)
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← links)
- Unique minimum semipaired dominating sets in trees (Q2107740) (← links)
- Linear-time algorithms for three domination-based separation problems in block graphs (Q2184661) (← links)
- On trees with unique locating kernels (Q2233388) (← links)
- Metric-locating-dominating sets of graphs for constructing related subsets of vertices (Q2333263) (← links)
- Fault-tolerant detectors for distinguishing sets in cubic graphs (Q2659159) (← links)
- On redundant locating-dominating sets (Q2686136) (← links)
- (Q3105546) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Vertices belonging to all or to no minimum locating dominating sets of trees (Q3639805) (← links)
- (Q4529516) (← links)
- Open-independent, open-locating-dominating sets (Q5006616) (← links)
- (Q5463506) (← links)
- Some rainbow problems in graphs have complexity equivalent to satisfiability problems (Q6071083) (← links)
