scientific article
From MaRDI portal
Publication:3279628
zbMath0099.12204MaRDI QIDQ3279628
Publication date: 1961
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (39)
Geometric systems of unbiased representatives ⋮ On generalizations of separating and splitting families ⋮ On the path separation number of graphs ⋮ Separating systems and oriented graphs of diameter two ⋮ The \textsc{red-blue separation} problem on graphs ⋮ On separating systems ⋮ \((2,1)\)-separating systems beyond the probabilistic bound ⋮ Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity ⋮ Completely separating systems of \(k\)-sets ⋮ Bisecting and \(D\)-secting families for set systems ⋮ On three domination-based identification problems in block graphs ⋮ Separating path systems for the complete graph ⋮ The \textsc{Red-Blue Separation} problem on graphs ⋮ Bipartite Hansel results for hypergraphs ⋮ Extremal Digraphs for open neighbourhood location-domination and identifying codes ⋮ System of unbiased representatives for a collection of bicolorings ⋮ Smart elements in combinatorial group testing problems with more defectives ⋮ On separating systems of graphs ⋮ Splitting systems and separating systems. ⋮ Covering complete hypergraphs with cuts of minimum total size ⋮ Parameterized and approximation complexity of \textsc{Partial VC Dimension} ⋮ On Antimagic Labeling for Generalized Web and Flower Graphs ⋮ Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension ⋮ Induced-bisecting families of bicolorings for hypergraphs ⋮ Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. ⋮ Smart elements in combinatorial group testing problems ⋮ Some new bounds for cover-free families through biclique covers ⋮ Minimal completely separating systems of \(k\)-sets ⋮ 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 ⋮ A generalization of completely separating systems ⋮ Characterizing extremal graphs for open neighbourhood location-domination ⋮ Combinatorial configurations in the definition of antimagic labelings of graphs ⋮ On separating systems with bounded set size ⋮ Disjoint Spread Systems and Fault Location ⋮ Probabilistic methods in group theory ⋮ Boolean dimension, components and blocks ⋮ On the theory of random search ⋮ Locating-dominating sets and identifying codes in graphs of girth at least 5
This page was built for publication:
