Reduce complexity for graph colouring ILP method by fixating one neighbour of the first node

Right now, the first node in the graph is assigned one colour as a constraint. However, one arbitrary neighbour of that node can also be assigned a colour as a constraint to reduce complexity further.