The weighted coloring problem for two graph classes characterized by small forbidden induced structures

We show that the weighted coloring problem can be solved for {P5,banner}-free graphs and for {P5,dart}-free graphs in polynomial time on the sum of vertex weights.