The following pages link to (Q3279628):
Displayed 38 items.
- On generalizations of separating and splitting families (Q311557) (← links)
- On the path separation number of graphs (Q313786) (← links)
- \((2,1)\)-separating systems beyond the probabilistic bound (Q375844) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- Covering complete hypergraphs with cuts of minimum total size (Q659756) (← links)
- A generalization of completely separating systems (Q713133) (← links)
- Boolean dimension, components and blocks (Q781531) (← links)
- Separating systems and oriented graphs of diameter two (Q864898) (← links)
- On separating systems (Q875044) (← links)
- On separating systems of graphs (Q1171075) (← links)
- Completely separating systems of \(k\)-sets (Q1382833) (← links)
- Splitting systems and separating systems. (Q1428538) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Induced-bisecting families of bicolorings for hypergraphs (Q1744760) (← links)
- Smart elements in combinatorial group testing problems (Q1752611) (← links)
- Some new bounds for cover-free families through biclique covers (Q1759404) (← links)
- The saturation number of induced subposets of the Boolean lattice (Q2012537) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- Characterizing extremal graphs for open neighbourhood location-domination (Q2043360) (← links)
- Combinatorial configurations in the definition of antimagic labelings of graphs (Q2043998) (← links)
- Geometric systems of unbiased representatives (Q2122784) (← links)
- The \textsc{red-blue separation} problem on graphs (Q2169962) (← links)
- Bisecting and \(D\)-secting families for set systems (Q2181239) (← links)
- Bipartite Hansel results for hypergraphs (Q2198970) (← links)
- System of unbiased representatives for a collection of bicolorings (Q2201776) (← links)
- On separating systems with bounded set size (Q2309567) (← links)
- Locating-dominating sets and identifying codes in graphs of girth at least 5 (Q2344817) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- Probabilistic methods in group theory (Q2555922) (← links)
- Disjoint Spread Systems and Fault Location (Q2830441) (← links)
- On Antimagic Labeling for Generalized Web and Flower Graphs (Q3000518) (← links)
- Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension (Q4636778) (← links)
- Smart elements in combinatorial group testing problems with more defectives (Q5121559) (← links)
- On the theory of random search (Q5512642) (← links)
- Minimal completely separating systems of \(k\)-sets (Q5929844) (← links)
- On three domination-based identification problems in block graphs (Q6132542) (← links)
- Separating path systems for the complete graph (Q6136668) (← links)
- The \textsc{Red-Blue Separation} problem on graphs (Q6168089) (← links)