scientific article; zbMATH DE number 3161569

Cited in

(52)

On separating systems of graphs
Completely separating systems of k-sets
Splitting systems and separating systems.
Induced-bisecting families of bicolorings for hypergraphs
Smart elements in combinatorial group testing problems
Some new bounds for cover-free families through biclique covers
The saturation number of induced subposets of the Boolean lattice
Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
Characterizing extremal graphs for open neighbourhood location-domination
Combinatorial configurations in the definition of antimagic labelings of graphs
Geometric systems of unbiased representatives
The \textsc{red-blue separation} problem on graphs
Bisecting and \(D\)-secting families for set systems
Bipartite Hansel results for hypergraphs
System of unbiased representatives for a collection of bicolorings
On separating systems with bounded set size
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
Probabilistic methods in group theory
Disjoint spread systems and fault location
On antimagic labeling for generalized web and flower graphs
On generalizations of separating and splitting families
On the path separation number of graphs
\((2,1)\)-separating systems beyond the probabilistic bound
Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension
Smart elements in combinatorial group testing problems with more defectives
Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
On the theory of random search
Minimal completely separating systems of \(k\)-sets
On three domination-based identification problems in block graphs
Separating path systems for the complete graph
The \textsc{Red-Blue Separation} problem on graphs
Extremal Digraphs for open neighbourhood location-domination and identifying codes
Separating path systems of almost linear size
Covering complete hypergraphs with cuts of minimum total size
On locating and neighbor-locating colorings of sparse graphs
On three domination-based identification problems in block graphs
Separating path systems in trees
On separating path and tree systems in graphs
Identifying codes in graphs of given maximum degree: characterizing trees
Structural parameterization of locating-dominating set and test cover
D-antimagic labelings arising from completely separating systems
Separating the edges of a graph by cycles and by subdivisions of K₄
Separating path systems in complete graphs
A generalization of completely separating systems
Tight (double) exponential bounds for identification problems: locating-dominating set and test cover
Identifying codes in triangle-free graphs of bounded maximum degree
Vertex-separating path systems in random graphs
Tight (double) exponential bounds for identification problems: locating-dominating set and test cover
Boolean dimension, components and blocks
Separating systems and oriented graphs of diameter two
On separating systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3279628)