A restraint on a (finite undirected) graph is a function on such that is a finite subset of ; a proper vertex colouring of is permitted by if for all vertices of (we think of as the set of colours forbidden at ). Given a large number of colors, for restraints with exactly one colour forbidden at each vertex the smallest number of colourings is permitted when is a constant function, but the problem of what restraints permit the largest number of colourings is more difficult. We determine such extremal restraints for complete graphs and trees.