  We show that there are polynomial-time algorithms to compute maximum
independent sets in the categorical products of two cographs and two
splitgraphs. We show that the ultimate categorical independence ratio is
computable in polynomial time for cographs.
