Independent set in categorical products of cographs and splitgraphs
Discrete Mathematics
2013-05-21 v1 Combinatorics
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.
Keywords
Cite
@article{arxiv.1305.4237,
title = {Independent set in categorical products of cographs and splitgraphs},
author = {W. Hon and T. Kloks and S. Liu and S. Poon and Y. Wang},
journal= {arXiv preprint arXiv:1305.4237},
year = {2013}
}