Edge-clique graphs of cocktail parties have unbounded rankwidth
classification
💻 cs.DM
math.CO
keywords
edge-cliquegraphsrankwidthcocktailcographsunboundedalgorithmattempt
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.