• Any source and destination nodes of a move can be coalesced if they don’t interfere – Although beware joining two nodes that make a K- colourable graph subsequently uncolourable • Safe strategies exist – E.g. coalesce x and y if new node has fewer than K neighbours of significant degree • More complex sequence of operations when register allocating with coalescing