1 research outputs found
A new upper bound for the clique cover number with applications
Let and , denote the size of a largest independent set
and the clique cover number of an undirected graph . Let be an interval
graph with and , and let denote the
maximum of overall induced subgraphs
of that are cliques in . The main result of this paper is to prove that
for any graph
where, is the size of a largest independent set in . We further
provide a generalization that significantly unifies or improves some past
algorithmic and structural results concerning the clique cover number for some
well known intersection graphs