Funder
Ministry of Science and Technology, Taiwan
National Natural Science Foundation of China
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference53 articles.
1. M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, in: Proceedings of 20th Annual ACM Symposium on Theory of Computing, (STOC 1988), New York, NY, USA, 1988, pp. 1–10.
2. Graph Theory;Bondy,2008
3. M. Braverman, F. Ellen, R. Oshman, T. Pitassi, V. Vaikuntanathan, A tight bound for set disjointness in the message-passing model, in: Proceedings of 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013), Berkeley, CA, USA, 26-29 Oct. 2013, pp. 668–677.
4. Rainbow trees in graphs and generalized connectivity;Chartrand;Networks,2010
5. A solution to a conjecture on the generalized connectivity of graphs;Chen;J. Comb. Optim.,2017
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献