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