The weighted coloring problem for two graph classes characterized by small forbidden induced structures
Under an Elsevier user license
open archive
Keywords
Computational complexity
Coloring problem
Hereditary class
Polynomial-time algorithm
Cited by (0)
© 2018 Elsevier B.V.