We introduce a graph-theoretical approach to the study of approximation of non-Boolean functions on Boolean algebra. We show that optimal interpolations of non-Boolean functions by Boolean functions are linked to minimal chromatic decompositions of graphs attached to these functions and we study special vertices in these graphs.
['Sergiu Rudeanu', 'Dan A. Simovici']
A graph-theoretical approach to Boolean interpolation of non-Boolean functions