Cover numbers by certain graph families

We define the cover number of a graph G by a graph class P as the minimum number of graphs of class P required to cover the edge set of G . Taking inspiration from a paper by Harary et al. (1977), we find an exact formula for the cover number by the graph classes { G ∣ χ ( G ) ≤ f ( ω ( G ) ) } for all non-decreasing functions f . After this, we establish a chain of inequalities between five cover numbers, the one by the class { G ∣ χ ( G ) = ω ( G ) } , by the class of perfect graphs, generalized split graphs, co-unipolar graphs and finally the cover number by bipartite graphs. We prove that at each inequality, the difference between the two sides can grow arbitrarily large. We also prove that the cover number by unipolar graphs cannot be expressed in terms of the chromatic or the clique number.