Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference4 articles.
1. B. Bollobás, Weakly k-saturated graphs, in “Proceedings of the Colloquium on Graph Theory,” Ilmenau, pp. 25–31.
2. On the time required to detect cycles and connectivity in graphs;Holt;Math. Systems Theory,1972
3. Determining graph properties from matrix representations;Kirkpatrick,1974
4. E. C. Milner and D. J. A. Welsh, “On the Computational Complexity of Graph Theoretical Properties,” Research Paper No. 232, Dept. of Math., Calgary University.”
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Elusive properties of infinite graphs;Journal of Graph Theory;2023-10-26
2. Elusiveness of Finding Degrees;Algorithms and Discrete Applied Mathematics;2017
3. Bibliography;Theory of Computational Complexity;2013-12-06
4. Gems in decision tree complexity revisited;ACM SIGACT News;2013-09-16
5. Streaming and Communication Complexity of Clique Approximation;Automata, Languages, and Programming;2012