The following pages link to (Q3684148):
Displaying 50 items.
- Locating-total dominating sets in twin-free graphs: a conjecture (Q311495) (← links)
- Location-domination in line graphs (Q329538) (← links)
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- Open neighborhood locating-dominating in trees (Q628345) (← links)
- Domination and location in twin-free digraphs (Q777359) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- On locating--dominating sets in infinite grids (Q819007) (← links)
- On a new class of identifying codes in graphs (Q845971) (← links)
- Locating-dominating sets in twin-free graphs (Q906432) (← links)
- Location-domination and matching in cubic graphs (Q906465) (← links)
- Discriminating codes in (bipartite) planar graphs (Q925038) (← links)
- Locating and paired-dominating sets in graphs (Q967383) (← links)
- Determining sets, resolving sets, and the exchange property (Q968219) (← links)
- Identification of points using disks (Q1618247) (← links)
- On regular and new types of codes for location-domination (Q1671339) (← links)
- Locating-dominating sets in hypergraphs (Q1677551) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Computing the \(k\)-metric dimension of graphs (Q1735142) (← links)
- On the density of identifying codes in the square lattice (Q1850615) (← links)
- On a conjecture regarding identification in Hamming graphs (Q2001977) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- On locating-dominating set of regular graphs (Q2052122) (← links)
- Improved lower bound for locating-dominating codes in binary Hamming spaces (Q2068380) (← links)
- Bounding the trace function of a hypergraph with applications (Q2089531) (← links)
- Locating-dominating sets: from graphs to oriented graphs (Q2092344) (← links)
- On connected 3-\(\gamma_L\)-dot-critical graphs (Q2151487) (← links)
- Covering codes of a graph associated with a finite vector space (Q2214154) (← links)
- Locating-dominating codes in paths (Q2275442) (← links)
- The solid-metric dimension (Q2285129) (← links)
- Optimal bounds on codes for location in circulant graphs (Q2311421) (← links)
- A note on the complexity of locating-total domination in graphs (Q2333807) (← links)
- Locating-dominating sets of functigraphs (Q2333813) (← links)
- Locating-paired-dominating sets in square grids (Q2346332) (← links)
- On the ensemble of optimal dominating and locating-dominating codes in a graph (Q2346565) (← links)
- On identifying codes that are robust against edge changes (Q2373878) (← links)
- Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (Q2376092) (← links)
- Locating domination in bipartite graphs and their complements (Q2420423) (← links)
- Extremal graphs for the identifying code problem (Q2430979) (← links)
- An optimal locating-dominating set in the infinite triangular grid (Q2433724) (← 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)
- Liar's domination (Q3057104) (← links)
- Location-2-Domination for Product of Graphs (Q3296833) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863) (← links)
- The determining number of a Cartesian product (Q3632997) (← links)
- Neighbourhood complexity of graphs of bounded twin-width (Q6081102) (← links)
