Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree.