16 citations · 18 across the 2 of their papers we have counts for
2 papers
math.CO2020★ 2 cited
Tight Bounds on the Clique Chromatic Number
Gwenaël Joret, Piotr Micek, Bruce Reed +1
The clique chromatic number of a graph is the minimum number of colours needed to colour its vertices so that no inclusion-wise maximal clique which is not an isolated vertex is mo…
math.CO2009★ 16 cited
The maximum number of cliques in a graph embedded in a surface
Vida Dujmović, Gašper Fijavž, Gwenaël Joret +2
This paper studies the following question: Given a surface and an integer , what is the maximum number of cliques in an -vertex graph embeddable in ? We characterise t…