NP-completeness of 4-incidence colorability of semi-cubic graphs (Q2470012)

From MaRDI portal





scientific article
Language Label Description Also known as
English
NP-completeness of 4-incidence colorability of semi-cubic graphs
scientific article

    Statements

    NP-completeness of 4-incidence colorability of semi-cubic graphs (English)
    0 references
    11 February 2008
    0 references
    incidence coloring number
    0 references
    \(k\)-incidence colorable
    0 references
    strong-vertex coloring
    0 references
    semi-cubic graph
    0 references
    NP-complete
    0 references
    0 references
    0 references

    Identifiers