On three domination-based identification problems in block graphs

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
The difference between the metric dimension and the determining number of a graph
Bounds for identifying codes in terms of degree parameters
Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
On graphs having a \(V\setminus \{x\}\) set as an identifying code
Location-domination and matching in cubic graphs
Distance-hereditary graphs
On metric properties of certain clique graphs
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
Polyhedra associated with identifying codes in graphs
Identifying and locating-dominating codes on chains and cycles
Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
Characterizing extremal graphs for open neighbourhood location-domination
Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
Linear-time algorithms for three domination-based separation problems in block graphs
Locating-dominating sets and identifying codes in graphs of girth at least 5
Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
Extremal graphs for the identifying code problem
Study of Identifying Code Polyhedra for Some Families of Split Graphs
Identifying Codes in Hereditary Classes of Graphs and VC-Dimension
Domination and location in acyclic graphs
A Characterization of Block-Graphs
On a new class of codes for identifying vertices in graphs
Total Domination in Graphs
Revisiting and Improving Upper Bounds for Identifying Codes
Identifying Codes in Line Graphs
On three domination-based identification problems in block graphs

This page was built for publication: On three domination-based identification problems in block graphs