Montassier, M., and P. Ochem. “Near-Colorings: Non-Colorable Graphs and NP-Completeness”. The Electronic Journal of Combinatorics, Vol. 22, no. 1, Mar. 2015, p. P1.57, doi:10.37236/3509.