NewEvery arXiv paper, its researchers & institutions — mapped.
paper

Independent set in categorical products of cographs and splitgraphs

arXiv:1305.4237

Abstract

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.