| Autor: |
Charbit, Pierre, Penev, Irena, Thomassé, Stéphan, Trotignon, Nicolas |
| Rok vydání: |
2015 |
| Předmět: |
|
| Zdroj: |
Journal of Combinatorial Theory, Series B, 116:456-464, 2016 |
| Druh dokumentu: |
Working Paper |
| DOI: |
10.1016/j.jctb.2015.09.008 |
| Popis: |
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, Sands, Sauer, and Woodrow in [Two-coloring all two-element maximal antichains, J. Combinatorial Theory, Ser. A, 57 (1991), 109-116]. |
| Databáze: |
arXiv |
| Externí odkaz: |
|
