A vertex colouring g of a graph G is said to be pseudocomplete if for any two distinct colours i, j there exists at least one edge e = (u, v) ∈ E(G) such that g(u) = i and g(v) = j. The maximum number of colors used in a ...