تقرير
Edge-clique graphs of cocktail parties have unbounded rankwidth
| العنوان: | Edge-clique graphs of cocktail parties have unbounded rankwidth |
|---|---|
| المؤلفون: | Chang, Maw-Shang, Kloks, Ton, Liu, Ching-Hao |
| سنة النشر: | 2012 |
| المجموعة: | Computer Science Mathematics |
| مصطلحات موضوعية: | Computer Science - Discrete Mathematics, Mathematics - Combinatorics |
| الوصف: | 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. |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/1205.2483 |
| رقم الأكسشن: | edsarx.1205.2483 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |