The following pages link to (Q3789614):
Displaying 50 items.
- The difference between the metric dimension and the determining number of a graph (Q298637) (← links)
- Locating-total dominating sets in twin-free graphs: a conjecture (Q311495) (← links)
- A polyhedral approach to locating-dominating sets in graphs (Q324734) (← links)
- Location-domination in line graphs (Q329538) (← links)
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- Bounds on the locating-total domination number of a tree (Q534338) (← links)
- Open neighborhood locating-dominating in trees (Q628345) (← links)
- Identifying codes and locating-dominating sets on paths and cycles (Q642979) (← links)
- On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs (Q786037) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- On locating--dominating sets in infinite grids (Q819007) (← links)
- Extremal cardinalities for identifying and locating-dominating codes in graphs (Q864121) (← links)
- Locating-dominating sets in twin-free graphs (Q906432) (← links)
- Bounds on the differentiating-total domination number of a tree (Q906441) (← links)
- Location-domination and matching in cubic graphs (Q906465) (← links)
- Locating and paired-dominating sets in graphs (Q967383) (← links)
- Determining sets, resolving sets, and the exchange property (Q968219) (← links)
- Minimal identifying codes in trees and planar graphs with large girth (Q976158) (← links)
- Upper bounds for binary identifying codes (Q1012154) (← links)
- On minimum dominating sets with minimum intersection (Q1174139) (← links)
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. (Q1401220) (← links)
- Well-located graphs: A collection of well-covered ones (Q1422424) (← links)
- Locating-dominating sets in hypergraphs (Q1677551) (← links)
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144) (← links)
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← links)
- Identifying and locating-dominating codes on chains and cycles (Q1883609) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs (Q2081516) (← links)
- Covering codes of a graph associated with a finite vector space (Q2214154) (← links)
- On two variations of identifying codes (Q2275454) (← links)
- Bounds on the locating-total domination number in trees (Q2282462) (← links)
- The compared costs of domination location-domination and identification (Q2282469) (← links)
- Locating-dominating sets of functigraphs (Q2333813) (← links)
- Locating-paired-dominating sets in square grids (Q2346332) (← links)
- Approximability of identifying codes and locating-dominating codes (Q2379937) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- Locating and identifying codes in circulant networks (Q2446842) (← links)
- Locating sensors in paths and cycles: the case of 2-identifying codes (Q2462318) (← links)
- A linear algorithm for minimum 1-identifying codes in oriented trees (Q2495905) (← links)
- Locating and total dominating sets in trees (Q2495911) (← links)
- On redundant locating-dominating sets (Q2686136) (← links)
- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs (Q2827829) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Discriminating codes in bipartite graphs (Q3439638) (← links)
- The determining number of a Cartesian product (Q3632997) (← links)
- On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs (Q5009472) (← links)
- The metric dimension of the lexicographic product of graphs (Q5894950) (← links)
- Some results about a conjecture on identifying codes in complete suns (Q6070992) (← links)
- Some rainbow problems in graphs have complexity equivalent to satisfiability problems (Q6071083) (← links)
- \( [ 1 , 2 ]\)-dimension of graphs (Q6162042) (← links)
