--
Pr. Liying Kang
(Department of Mathematics, Shanghai University, China)
ABSTRACT: A maximal clique of a graph is a clique not properly contained in
any other clique. A \(k\)-clique coloring of a graph is an assignment of a \(k\)
colors to the vertices of \(G\) such that no maximal clique with at least two
vertices is monochromatic. The clique-chromatic ...
