Some useful miscellaneous components.
AUTHORS:
The colours used by a colouring (vertex-to-color map).
Compute the independence number of ‘graph’.
The vertices where a colour appears in a vertex-to-colour map.
A list of those vertices in ‘nodes’ which have ‘colour’ in the list associated with that vertex by ‘list_assignment’.
The subgraph induced by those vertices of ‘graph’ which have ‘colour’ in the list associated by ‘list_assignment’.
Translate a verticex-to-colour map into a colour-to-vertices map.