"The computational complexity of weighted vertex coloring for P5, ..."

Dmitriy S. Malyshev, Olga O. Razvenskaya, Panos M. Pardalos (2021)

> Home

Details and statistics

DOI: 10.1007/S11590-020-01593-0

access: closed

type: Journal Article

metadata version: 2023-07-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ol/MalyshevRP21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ol/MalyshevRP21
Dmitriy S. Malyshev, Olga O. Razvenskaya, Panos M. Pardalos:
The computational complexity of weighted vertex coloring for P_{5, K_{2, 3}, K^{+_{2, 3}}}-free graphs. Optim. Lett. 15(1): 137-152 (2021)

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.