Author:
Agrawal Akanksha,Kundu Madhumita,Sahu Abhishek,Saurabh Saket,Tale Prafullkumar
Publisher
Springer International Publishing
Reference18 articles.
1. Aloisio, A., Mkrtchyan, V.: On the fixed-parameter tractability of the maximum 2-edge-colorable subgraph problem. arXiv preprint arXiv:1904.09246 (2019)
2. Alon, N., Yuster, R., Zwick, U.: Color coding. In: Kao, M. (ed.) Encyclopedia of Algorithms - 2008 Edition (2008)
3. Cao, Y., Chen, G., Jing, G., Stiebitz, M., Toft, B.: Graph edge coloring: a survey. Graphs Comb. 35(1), 33–66 (2019). https://doi.org/10.1007/s00373-018-1986-5
4. Lecture Notes in Computer Science;J Chen,2006
5. Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40–42), 3736–3756 (2010)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献