The following pages link to (Q3565861):
Displaying 35 items.
- Algorithmic aspects of open neighborhood location-domination in graphs (Q344871) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- Open neighborhood locating-dominating in trees (Q628345) (← links)
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603) (← links)
- Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
- Bounds on the locating Roman domination number in trees (Q1692624) (← links)
- Bounds on the locating-domination number and differentiating-total domination number in trees (Q1708392) (← links)
- Characterizing extremal graphs for open neighbourhood location-domination (Q2043360) (← links)
- Open locating-dominating sets in circulant graphs (Q2062672) (← links)
- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs (Q2081516) (← links)
- Bounding the trace function of a hypergraph with applications (Q2089531) (← links)
- Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs (Q2091788) (← links)
- The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations (Q2132340) (← links)
- Open-independent, open-locating-dominating sets in complementary prism graphs (Q2132352) (← links)
- Extremal cubic graphs for fault-tolerant locating domination (Q2143147) (← links)
- Linear-time algorithms for three domination-based separation problems in block graphs (Q2184661) (← links)
- Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
- Binary locating-dominating sets in rotationally-symmetric convex polytopes (Q2337871) (← links)
- Locating-dominating sets and identifying codes in graphs of girth at least 5 (Q2344817) (← links)
- Optimal open-locating-dominating sets in infinite triangular grids (Q2354721) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- Fault-tolerant detectors for distinguishing sets in cubic graphs (Q2659159) (← links)
- On redundant locating-dominating sets (Q2686136) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- The binary locating-dominating number of some convex polytopes (Q4604525) (← links)
- Open-independent, open-locating-dominating sets (Q5006616) (← links)
- The open-locating-dominating number of some convex polytopes (Q5014387) (← links)
- MOVABLE DIFFERENTIATING-DOMINATION IN GRAPHS (Q5075615) (← links)
- ON MULTIPLE INTRUDER LOCATING DOMINATION IN INFINITE GRIDS (Q5075640) (← links)
- My Favorite Domination Conjectures in Graph Theory Are Bounded (Q5506786) (← links)
- Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs (Q5864729) (← links)
- (Q5889911) (← links)
- Progress on fault-tolerant locating-dominating sets (Q6174163) (← links)
- On the binary locating-domination number of regular and strongly-regular graphs (Q6200320) (← links)
- Extremal Digraphs for open neighbourhood location-domination and identifying codes (Q6202938) (← links)
