z-logo
open-access-imgOpen Access
Efficient solvability of the weighted vertex coloring problem for some hereditary class of graphs with $5$-vertex prohibitions
Author(s) -
Грибанов Дмитрий Владимирович,
Малышев Дмитрий Сергеевич,
Мокеев Дмитрий Борисович
Publication year - 2020
Publication title -
diskretnyj analiz i issledovanie operacij. seriâ 1
Language(s) - English
Resource type - Journals
ISSN - 1560-7542
DOI - 10.33048/daio.2020.27.668
Subject(s) - vertex (graph theory) , combinatorics , mathematics , class (philosophy) , graph , computer science , artificial intelligence

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here