Updating the complexity status of coloring graphs without a fixed induced linear forest

This publication has 14 references indexed in Scilit:

• Three Complexity Results on Coloring P k -Free Graphs
  Lecture Notes in Computer Science, 2009
• Deciding k-Colorability of P 5-Free Graphs in Polynomial Time
  Algorithmica, 2008
• On the complexity of 4-coloring graphs without long induced paths
  Theoretical Computer Science, 2007
• Vertex Colouring and Forbidden Subgraphs ? A Survey
  Graphs and Combinatorics, 2004
• 3-Colorability ∈P for P6-free graphs
  Discrete Applied Mathematics, 2004
• The 3-Colorability Problem on Graphs with Maximum Degree Four
  SIAM Journal on Computing, 2003
• Graph colorings with local constraints -- a survey
  Discussiones Mathematicae Graph Theory, 1997
• On graphs with polynomially solvable maximum‐weight clique problem
  Networks, 1989
• The complexity of colouring problems on dense graphs
  Theoretical Computer Science, 1986
• A New Algorithm for Generating All the Maximal Independent Sets
  SIAM Journal on Computing, 1977