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) -
D. V. Gribanov,
D. S. Malyshev,
Д. Б. Мокеев
Publication year - 2020
Publication title -
diskretnyi analiz i issledovanie operatsii
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
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom