default search action

combined dblp search
author search
venue search
publication search

ask others

O. O. Lobanova

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2010 – 2019

see FAQ

What is the meaning of the colors in the publication lists?

2017
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/dam/MalyshevL17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/MalyshevL17
Dmitriy S. Malyshev, O. O. Lobanova:
Two complexity results for the vertex coloring problem. Discret. Appl. Math. 219: 158-166 (2017)
2015
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/MalyshevL15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/MalyshevL15
Dmitriy S. Malyshev, O. O. Lobanova:
The coloring problem for {P₅, P̅₅}-free graphs and {P₅, K_p-e}-free graphs is polynomial. CoRR abs/1503.02550 (2015)

Coauthor Index

see FAQ

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.