Edge-clique graphs of cocktail parties have unbounded rankwidth
From MaRDI portal
Publication:6232935
arXiv1205.2483MaRDI QIDQ6232935FDOQ6232935
Authors: Maw-Shang Chang, Ton Kloks, Ching-Hao Liu 
Publication date: 11 May 2012
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.
This page was built for publication: Edge-clique graphs of cocktail parties have unbounded rankwidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6232935)
