Publication:3279628
From MaRDI portal
zbMath0099.12204MaRDI QIDQ3279628
Publication date: 1961
Related Items
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, 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, On generalizations of separating and splitting families, On the path separation number of graphs, \((2,1)\)-separating systems beyond the probabilistic bound, Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds., Covering complete hypergraphs with cuts of minimum total size, A generalization of completely separating systems, Boolean dimension, components and blocks, Separating systems and oriented graphs of diameter two, On separating systems, On separating systems of graphs, Completely separating systems of \(k\)-sets, Splitting systems and separating systems., Parameterized and approximation complexity of \textsc{Partial VC Dimension}, 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
