The computational complexity of weighted vertex coloring for $$\{P_5,K_{2,3},K^+_{2,3}\}$$-free graphs
Crossref DOI link: https://doi.org/10.1007/s11590-020-01593-0
Published Online: 2020-05-23
Published Print: 2021-02
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Malyshev, D. S.
Razvenskaya, O. O.
Pardalos, P. M.
Funding for this research was provided by:
Russian Science Support Foundation (19-71-00005)
Text and Data Mining valid from 2020-05-23
Version of Record valid from 2020-05-23
Article History
Received: 5 October 2019
Accepted: 13 May 2020
First Online: 23 May 2020