On retracts, absolute retracts, and folds in cographs
Discrete Mathematics
2013-03-26 v4
Abstract
Let G and H be two cographs. We show that the problem to determine whether H is a retract of G is NP-complete. We show that this problem is fixed-parameter tractable when parameterized by the size of H. When restricted to the class of threshold graphs or to the class of trivially perfect graphs, the problem becomes tractable in polynomial time. The problem is also soluble when one cograph is given as an induced subgraph of the other. We characterize absolute retracts of cographs.
Keywords
Cite
@article{arxiv.1301.3979,
title = {On retracts, absolute retracts, and folds in cographs},
author = {Ton Kloks and Yue-Li Wang},
journal= {arXiv preprint arXiv:1301.3979},
year = {2013}
}
Comments
15 pages