Author:
Feder Tomás,Hell Pavol,Nekooei Rizi Shekoofeh
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference32 articles.
1. On digraph coloring problems and treewidth duality;Atserias;European J. Combin.,2008
2. The complexity of the list partition problem for graphs;Cameron;SIAM J. Discrete Math.,2007
3. Star-cutsets and perfect graphs;Chvátal;J. Combin. Theory Ser. B,1985
4. M. Cygan, M. Pilipczuk, M. Pilipczuk, J.O. Wojtaszczyk, The stubborn problem is stubborn no more: a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem, in: Proceedings of the Twenty-Second Annual ACM–SIAM Symposium on Discrete Algorithms, SODA’11, pp. 1666–1674.
5. Induced subgraphs and well-quasi-ordering;Damaschke;J. Graph Theory,1990
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献