Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. On generalized graphs;Bollobás;Acta Math. Acad. Sci. Hungar.,1965
2. B. Bollobás, A. Scott, On separating systems, European J. Combin., in press
3. On a problem concerning separating systems of a finite set;Dickson;J. Combin. Theory,1969
4. Nombre minimal de contacts de fermeture nécessaires pour réaliser une fonction booléenne symétrique de n variables;Hansel;C. R. Acad. Sci. Paris,1964
5. On separating systems of a finite set;Katona;J. Combin. Theory,1966
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Separating path systems of almost linear size;Transactions of the American Mathematical Society;2024-06-11
2. Separating path systems for the complete graph;Discrete Mathematics;2024-03
3. Rainbow Saturation and Graph Capacities;SIAM Journal on Discrete Mathematics;2018-01
4. On the Biclique Cover of the Complete Graph;Graphs and Combinatorics;2014-11-13
5. Separating path systems;Journal of Combinatorics;2014