1. On graphs with polynomially solvable maximum-weight clique problem;Balas;Networks,1989
2. Triangle-free graphs and forbidden subgraphs;Brandt;Discrete Appl. Math.,2002
3. H.J. Broersma, F.V. Fomin, P.A. Golovach, D. Paulusma, Three complexity results on coloring Pk-free graphs, in: Proceedings of the 20th International Workshop on Combinatorial Algorithms, IWOCA 2009, Lecture Notes in Computer Science, vol. 5874, 2009, pp. 95–104.
4. H.J. Broersma, P.A. Golovach, D. Paulusma, J. Song, Updating the complexity status of coloring graphs without a fixed induced linear forest, manuscript, http://www.dur.ac.uk/daniel.paulusma/Papers/Submitted/updating.pdf.
5. D. Bruce, C.T. Hoàng, J. Sawada, A certifying algorithm for 3-colorability of P5-free graphs, in: Proceedings of the 20th International Symposium on Algorithms and Computation, ISAAC 2009, Lecture Notes in Computer Science, vol. 5878, 2009, pp. 594–604.