Author:
Pandey Sukanya,Raman Venkatesh,Sahlot Vibha
Publisher
Springer International Publishing
Reference20 articles.
1. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844–856 (1995)
2. Banik, A., Jacob, A., Paliwal, V.K., Raman, V.: Fixed-parameter tractability of (n-k) list coloring. In: IWOCA 2019, Proceedings. pp. 61–69 (2019)
3. Chaplick, S., Fiala, J., van ’t Hof, P., Paulusma, D., Tesar, M.: Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. Theor. Comput. Sci. 590, 86–95 (2015)
4. Chor, B., Fellows, M., Juedes, D.W.: Linear kernels in linear time, or how to save k colors in o(n$${}^{\text{2}}$$) steps. In: WG 2004, Revised Papers. pp. 257–269 (2004)
5. Dourado, M.C.: Computing role assignments of split graphs. Theor. Comput. Sci. 635, 74–84 (2016)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献