The graph (vertex) colouring problem (GCP) can be posed as a decision or ... the decision version, also called the (v e r t e x) ù-colour ing p ro b le m , the ... found but no proof of its non - existence is given, as it is typically the case .... heuristic consists of two steps : fi rst, the next vertex to be coloured is chosen, and next this.
