A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (Q408371)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
scientific article

    Statements

    Identifiers