|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 19 of 20 found articles
| Title: |
The computational complexity of weighted vertex coloring for {P5,K2,3,K2,3+}-free graphs |
| Author: |
Malyshev, D. S. Razvenskaya, O. O. Pardalos, P. M. |
| Appeared in: |
Optimization letters |
| Paging: | Volume 15 () nr. 1 pages 137-152 |
| Year: |
2020-05-23 |
| Contents: | |
| Publisher: |
Springer Berlin Heidelberg, Berlin/Heidelberg |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 19 of 20 found articles
| << previous | next >> |