On a problem concerning separating systems of a finite set
From MaRDI portal
Cited in
(20)- On separating systems of graphs
- Completely separating systems of k-sets
- Induced-bisecting families of bicolorings for hypergraphs
- Smart elements in combinatorial group testing problems
- Combinatorial configurations in the definition of antimagic labelings of graphs
- Geometric systems of unbiased representatives
- Bipartite Hansel results for hypergraphs
- System of unbiased representatives for a collection of bicolorings
- Inclusionwise minimal completely separating systems
- Rectangular submatrices of inverse \(\mathcal M\)-matrices and the decomposition of a positive matrix as a sum
- On a relationship between completely separating systems and antimagic labeling of regular graphs
- On antimagic labeling for generalized web and flower graphs
- On the path separation number of graphs
- Smart elements in combinatorial group testing problems with more defectives
- Minimal completely separating systems of \(k\)-sets
- D-antimagic labelings arising from completely separating systems
- Construction of antimagic labeling for the Cartesian product of regular graphs
- A generalization of completely separating systems
- Separating systems and oriented graphs of diameter two
- On separating systems
This page was built for publication: On a problem concerning separating systems of a finite set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5608784)
