A graph is node$-$consistent if

a$)$ If all the values in the variable's domain in the graph satisfy its binary constraints.

b$)$ If all the values in the variable's domain in the graph satisfy its unary constraints.

c$)$ If all the values in the variable's domain in the graph satisfy its path consistency

constraints.

d$)$ None of the above

e$)$ a and b above