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