Author:
Broersma Hajo,Fomin Fedor V.,Golovach Petr A.,Paulusma Daniël
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer Graduate Texts in Mathematics, vol. 244 (2008)
2. Edwards, K.: The complexity of coloring problems on dense graphs. Theor. Comp. Science 43, 337–343 (1986)
3. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
4. Hoàng, C.T., Kamiński, M., Lozin, V., Sawada, J., Shu, X.: Deciding k-colorability of P 5-free graphs in polynomial time. Algorithmica (in press), doi:10.1007/s00453-008-9197-8
5. van ’t Hof, P., Paulusma, D.: A new characterization of P 6-free graphs. Discrete Appl. Math. (in press), doi:10.1016/j.dam.2008.08.025
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献