  Here we prove that for a 2K2-free graph G with maximum degree greater than or
equal to 5, the chromatic number is less than or equal to max{maximum degree-1,
maximum clique size}. This implies that Borodin & Kostochka Conjecture is true
for 2K2-free graphs.
