A vertex colouring of some graph is called
perfect if each
vertex of colour

has the same number

of neighbours of
colour

. Here we determine all perfect colourings of the edge
graphs of the hypercube in dimensions 4 and 5 by two and three
colours, respectively. For comparison we list all perfect colourings
of the edge graphs of the simplex in dimensions 4 and 5,
respectively.