Two complexity results for the vertex coloring problem (Q505438)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Two complexity results for the vertex coloring problem
scientific article

    Statements

    Two complexity results for the vertex coloring problem (English)
    0 references
    0 references
    0 references
    23 January 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    coloring problem
    0 references
    hereditary class
    0 references
    polynomial-time algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references