Author:
Cioabă Sebastian M.,Kündgen André
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference18 articles.
1. Bollobás B., Scott A.: Separating systems and oriented graphs of diameter two. J. Comb. Theory Ser B 97, 193–203 (2007)
2. Bollobás B., Scott A.: On separating systems. Eur. J. Combinatorics 28, 1068–1071 (2007)
3. Fredman M.L., Komlós J.: On the size of separating systems and families of perfect hash functions. SIAM J. Alg. Discr. Methods 5, 61–68 (1984)
4. Füredi Z., Kündgen A.: Covering a graph with cuts of minimum size. Discrete Math. 237, 129–148 (2001)
5. Garey M.R., Johnson D.S.: Computers and Intractability a guide to the theory of NP-completeness. W.H. Freeman and Company, New York (1978)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the decomposition of random hypergraphs;Journal of Combinatorial Theory, Series B;2018-03
2. On the Biclique Cover of the Complete Graph;Graphs and Combinatorics;2014-11-13