Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. Paths, trees and flowers;Edmonds;Canad. J. Math.,1965
2. On the connectivity of random m-orientable graphs and digraphs;Fenner;Combinatorica,1982
3. On the existence of hamiltonian cycles in a class of random graphs;Fenner;Discrete Math.,1983
4. Über extreme Punkt- und Kantenmengen;Gallai;Ann. Univ. Sci. Budapest, Eötvös Sect. Math,1959
5. An exact threshold theorem for random graphs and the node-packing problem;Grimmett;J. Combin. Theory Ser. B,1986
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献