The core idea of vertex categorisation consists in trying to separate vertices into as many categories as possible, each of these categories being identifiable independently of the representation of the graph. For instance, in this work, vertices are separated according to their coordination sequence (the number of vertices at distance k from the vertex of interest with k = 1, 2, ..., see Introduction), so that two vertices are in the same category if and only if they share the same coordination sequence up to distance 10.