Independent sets in edge-clique graphs
Combinatorics
2012-06-12 v1 Discrete Mathematics
Abstract
We show that the edge-clique graphs of cocktail party graphs have unbounded rankwidth. This, and other observations lead us to conjecture that the edge-clique cover problem is NP-complete for cographs. We show that the independent set problem on edge-clique graphs of cographs and of distance-hereditary graphs can be solved in O(n^4) time. We show that the independent set problem on edge-clique graphs of graphs without odd wheels remains NP-complete.
Keywords
Cite
@article{arxiv.1206.1993,
title = {Independent sets in edge-clique graphs},
author = {Maw-Shang Chang and Ton Kloks and Ching-Hao Liu},
journal= {arXiv preprint arXiv:1206.1993},
year = {2012}
}
Comments
arXiv admin note: incorporates arXiv:1205.2483