Fault Diagnosis as a Graph Coloring Problem
Sheldon B. Akers · IEEE Transactions on Computers · 1974
A method is presented for converting problems in fault diagnosis into ones involving coloring (labeling) the nodes of a graph. It is shown that many concepts and results of graph theory have direct counterparts in fault diagnosis. Specific fault diagnosis problems examined include exercising tests, fanout free networks, test point insertion, sensitized paths, and fault test generation. A number of examples are included.