Edge-clique graphs of cocktail parties have unbounded rankwidth
Discrete Mathematics
2012-05-14 v1 Combinatorics
Abstract
In an attempt to find a polynomial-time algorithm for the edge-clique cover problem on cographs we tried to prove that the edge-clique graphs of cographs have bounded rankwidth. However, this is not the case. In this note we show that the edge-clique graphs of cocktail party graphs have unbounded rankwidth.
Cite
@article{arxiv.1205.2483,
title = {Edge-clique graphs of cocktail parties have unbounded rankwidth},
author = {Maw-Shang Chang and Ton Kloks and Ching-Hao Liu},
journal= {arXiv preprint arXiv:1205.2483},
year = {2012}
}