This implies a simpler algorithm for checking the 3 colorability of P6 free graphs than the algorithm given by Randerath and Schiermeyer. Finally, we prove that 6 coloring is NP complete for P7 free graphs. This problem was known to be polynomially solvable for P5 free graphs and NP complete for P8 free graphs, so […]