3-coloring a graph with propositional formulas
Hint: Try to formalize the following:


Every node has at least one color.
Every node has at most one color. (This is actually not necessary.)
Any two adjacent nodes cannot have the same color.


Another hint:


   The first can be formalized as $R_i \lor B_i \lor Y_i$ for all $i$.