Independent sets in edge-clique graphs II
Combinatorics
2013-05-07 v2 Discrete Mathematics
Abstract
We show that 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. We show that the independent set problem on edge-clique graphs of graphs without odd wheels remains NP-complete. We present a PTAS for planar graphs and show that the problem is polynomial for planar graphs without triangle separators.
Keywords
Cite
@article{arxiv.1206.5082,
title = {Independent sets in edge-clique graphs II},
author = {Ching-Hao Liu and Ton Kloks and Sheung-Hung Poon},
journal= {arXiv preprint arXiv:1206.5082},
year = {2013}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1206.1993