Perfect graphs of arbitrarily large clique-chromatic number

详细信息    查看全文

• 作者：Pierre Charbit^a ; ^{pierre.charbit@liafa.univ-paris-diderot.fr" class="auth_mail" title="E-mail the corresponding author} ; Irena Penev^b ; ¹ ; ^{irena.penev@ens-lyon.fr" class="auth_mail" title="E-mail the corresponding author} ; Sté ; phan Thomassé ; ^b ; ¹ ; ^{stephan.thomasse@ens-lyon.fr" class="auth_mail" title="E-mail the corresponding author} ; Nicolas Trotignon^b ; ¹ ; ^{nicolas.trotignon@ens-lyon.fr" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Perfect graph ; Clique coloring ; Clique-chromatic number
• 刊名：Journal of Combinatorial Theory, Series B
• 出版年：2016
• 出版时间：January 2016
• 年：2016
• 卷：116
• 期：Complete
• 页码：456-464
• 全文大小：288 K

文摘

We prove that there exist perfect graphs of arbitrarily large clique-chromatic number. These graphs can be obtained from cobipartite graphs by repeatedly gluing along cliques. This negatively answers a question raised by Duffus et al. (1991) [5].