On a problem concerning separating systems of a finite set
From MaRDI portal
Publication:5608784
DOI10.1016/S0021-9800(69)80011-6zbMATH Open0208.02403OpenAlexW2076191827MaRDI QIDQ5608784FDOQ5608784
Authors: T. J. Dickson 
Publication date: 1969
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(69)80011-6
Cited In (19)
- Inclusionwise minimal completely separating systems
- Construction of antimagic labeling for the Cartesian product of regular graphs
- Separating systems and oriented graphs of diameter two
- Induced-bisecting families of bicolorings for hypergraphs
- Geometric systems of unbiased representatives
- A generalization of completely separating systems
- System of unbiased representatives for a collection of bicolorings
- On antimagic labeling for generalized web and flower graphs
- Minimal completely separating systems of \(k\)-sets
- On a relationship between completely separating systems and antimagic labeling of regular graphs
- Completely separating systems of \(k\)-sets
- On the path separation number of graphs
- Combinatorial configurations in the definition of antimagic labelings of graphs
- On separating systems of graphs
- On separating systems
- Rectangular submatrices of inverse \(\mathcal M\)-matrices and the decomposition of a positive matrix as a sum
- Bipartite Hansel results for hypergraphs
- Smart elements in combinatorial group testing problems with more defectives
- Smart elements in combinatorial group testing problems
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)
