Author:
Bruce Daniel,Hoàng Chính T.,Sawada Joe
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Bacsó, G., Tuza, Z.: Dominating cliques in P
5-free graphs. Period. Math. Hungar. 21(4), 303–308 (1990)
2. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9(3), 251–280 (1990)
3. Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Annals of Mathematics 164(1), 51–229 (2006)
4. Hoàng, C.T., Kaminśki, M., Lozin, V., Sawada, J., Shu, X.: Deciding k-colorability of P5-free graphs in polynomial time. To appear in Algorithmica
5. Lecture Notes in Computer Science;C.T. Hoàng,2008
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献