Perfect graphs of arbitrarily large clique-chromatic number - Archive ouverte HAL Access content directly
Journal Articles Journal of Combinatorial Theory, Series B Year : 2016

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].

Dates and versions

hal-01324052 , version 1 (31-05-2016)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More