Defective vertex colorings were introduced in 1986 by R.Cowen, L.Cowen and D. Woodall and were widely studied since then. These colorings allow a fixed number of neighbors of a vertex v to have the same color as v. We introduce an efficient computational method in Mathematica for finding defective colorings for a finite graph that runs in polynomial time.
