| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656696 | Journal of Combinatorial Theory, Series B | 2016 | 9 Pages |
Abstract
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].
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Pierre Charbit, Irena Penev, Stéphan Thomassé, Nicolas Trotignon,