Skip to Main content Skip to Navigation
Journal articles

Perfect graphs of arbitrarily large clique-chromatic number

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].
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01324052
Contributor : Stéphan Thomassé <>
Submitted on : Tuesday, May 31, 2016 - 3:30:33 PM
Last modification on : Saturday, September 11, 2021 - 3:18:27 AM

Links full text

Identifiers

Citation

Pierre Charbit, Irena Penev, Stéphan Thomassé, Nicolas Trotignon. Perfect graphs of arbitrarily large clique-chromatic number. Journal of Combinatorial Theory, Series B, Elsevier, 2016, 116, pp.456-464. ⟨10.1016/j.jctb.2015.09.008⟩. ⟨hal-01324052⟩

Share

Metrics

Record views

815