On the complexity of 4-coloring graphs without long induced paths

This publication has 9 references indexed in Scilit:

• The strong perfect graph theorem
  Annals of Mathematics, 2006
• Recognizing Berge Graphs
  Combinatorica, 2005
• Vertex Colouring and Forbidden Subgraphs ? A Survey
  Graphs and Combinatorics, 2004
• 3-Colorability ∈P for P6-free graphs
  Discrete Applied Mathematics, 2004
• Some results on graphs without long induced paths
  Information Processing Letters, 2003
• Three-colourability and forbidden subgraphs. II: polynomial algorithms
  Discrete Mathematics, 2002
• Weighted parameters in (P5, P5)-free graphs
  Discrete Applied Mathematics, 1997
• Perfect graphs with noP 5 and noK 5
  Graphs and Combinatorics, 1994
• Dominating cliques in P5-free graphs
  Periodica Mathematica Hungarica, 1990