O. O. Lobanova

Two complexity results for the vertex coloring problem

Dmitriy S. Malyshev, O. O. Lobanova, D. Malyshev, 2017, Discret. Appl. Math..

The coloring problem for {P5, P̅5}-free graphs and {P5, Kp-e}-free graphs is polynomial pdf

Dmitriy S. Malyshev, O. O. Lobanova, D. Malyshev, 2015, ArXiv.