Author:
Golovach Petr A.,Paulusma Daniël,Song Jian
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Bonomo, F., Durán, G., Marenco, J.: Exploring the complexity boundary between coloring and list-coloring. Ann. Oper. Res. 169, 3–16 (2009)
2. Lecture Notes in Computer Science;H. Broersma,2009
3. Broersma, H.J., Golovach, P.A., Paulusma, D., Song, J.: Updating the complexity status of coloring graphs without a fixed induced linear forest. Theoretical Computer Science 414, 9–19 (2012)
4. Erdös, P., Rubin, A.L., Taylor, H.: Choosabilty in graphs. In: Proc. West Coast Conference on Combinatorics, Graph Theory and Computing, pp. 125–157 (1979)
5. Lecture Notes in Computer Science;P.A. Golovach,2012
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献