The intersection number of G is the smallest number of cliques that together cover all edges of G.
A maximum clique transversal of a graph is a subset of vertices with the property that each maximum clique of the graph contains at least one vertex in the subset.