MONTASSIER, M.; OCHEM, P. Near-Colorings: Non-Colorable Graphs and NP-Completeness. The Electronic Journal of Combinatorics, v. 22, n. 1, p. P1.57, 6 Mar. 2015.