Hashing parts of the problem works for interactive proofs.

I know a graph colouring, so I hash the {color, random salt} pair for every node. The other party chooses two connected nodes at random at asks me to reveal the {color, salt} pairs and checks if colors are different.