We know that for general graphs vertex coloring problem/ minimum clique cover problem are hard and for perfect graphs, they can be solved in polynomial time. My question is that:

Are there any families of graphs that we know vertex coloring problem/ minimum clique cover problem are **hard**?

I have a problem and I want to show that it is hard and I want to find such a family of graphs and use them and induced graphs for my problem.