Author:
Zverovich Inna,Zverovich Igor
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference34 articles.
1. When are chordal graphs also partition graphs?;Anbeek;Austral. J. Combin.,1997
2. R.H. Cowen, Hypergraph satisfiability, Rep. Math. Logic (25) (1991) 113–117.
3. R.H. Cowen, Combinatorial analytic tableaux, Rep. Math. Logic (27) (1993) 29–39.
4. R.H. Cowen, Some connections between set theory and computer science, in: Computational Logic and Proof Theory, Brno, 1993, Lecture Notes in Computer Science, vol. 713, Springer, Berlin, 1993, pp. 14–22.
5. R.H. Cowen, Property S, Rep. Math. Logic (35) (2001) 61–74.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algorithm of Finding All Maximal Induced Bicliques of Hypergraph;Communications in Computer and Information Science;2022
2. On Problem of Finding all Maximal Induced Bicliques of Hypergraph;Journal of Siberian Federal University. Mathematics & Physics;2021-10
3. On connection between bicliques of hypergraph and all maximally complete submatrices of adjacency matrix;Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitel'naya tekhnika i informatika;2021-09-01
4. Strong cliques in diamond-free graphs;Theoretical Computer Science;2021-02
5. Strong Cliques in Diamond-Free Graphs;Graph-Theoretic Concepts in Computer Science;2020