Author:
Kanj Iyad A.,Kratsch Dieter
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Agnarsson, G., Greenlaw, R., Halldórsson, M.: On powers of chordal graphs and their colorings. Congressus Numerantium 144, 41–65 (2000)
2. Bar-Yehuda, R., Feldman, I., Rawitz, D.: Improved approximation algorithm for convex recoloring of trees. Theory of Computing Systems 43(1), 3–18 (2008)
3. Bodlaender, H., Fellows, M., Langston, M., Ragan, M., Rosamond, F., Weyer, M.: Quadratic kernelization for convex recoloring of trees. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 86–96. Springer, Heidelberg (2007)
4. Bodlaender, H., Weyer, M.: Convex and connected recoloring of trees and graphs (unpublished manuscript, 2005)
5. Chor, B., Fellows, M., Ragan, M., Razgon, I., Rosamond, F., Snir, S.: Connected coloring completion for general graphs: Algorithms and complexity. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 75–85. Springer, Heidelberg (2007)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献