Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference13 articles.
1. Finite Groups of Automorphisms;Biggs,1971
2. The complexity of theorem-proving procedures;Cook;Proc. Third Annual ACM Symposium on the Theory of Computing,1971
3. Paths, trees and flowers;Edmonds;Can. J. Math.,1965
4. Widths and heights of (0, 1)-matrices;Fulkerson;Can. J. Math.,1961
5. Multiplicities and minimal widths for (0, 1)-matrices;Fulkerson;Can. J. Math.,1962
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Opinion;The Mathematical Intelligencer;1990-12
2. Combinatorial analysis (matrix problems, order theory);Journal of Soviet Mathematics;1983