O. O. Lobanova

According to our database1, O. O. Lobanova authored at least 2 papers between 2015 and 2017.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Two complexity results for the vertex coloring problem.
Discret. Appl. Math., 2017

2015
The coloring problem for {P<sub>5</sub>, P̅<sub>5</sub>}-free graphs and {P<sub>5</sub>, K<sub>p</sub>-e}-free graphs is polynomial.
CoRR, 2015


  Loading...