I would like to obtain a list of special graphs where there exist polynomial algorithms to find the minimum (vertex) clique cover. Some of the known cases are:
- Perfect graph including bipartite graphs, chordal graphs, complete graphs
- Triangle-free graph
Does there exist any types of graphs other than the ones listed above, such that there exist polynomial algorithms for their minimum clique cover problem?