The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (Q2409536)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs
scientific article

    Statements

    The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (English)
    0 references
    11 October 2017
    0 references
    vertex 3-colorability problem
    0 references
    computational complexity
    0 references
    polynomial-time algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references