The coloring problem for {P5, P̅5}-free graphs and {P5, Kp-e}-free graphs is polynomial. - Dmitriy S. Malyshev; O. O. Lobanova (CoRR, 2015)

Two complexity results for the vertex coloring problem. - Dmitriy S. Malyshev; O. O. Lobanova (Discret. Appl. Math., 2017)