Complexity of conflict-free colorings of graphs (Q484316)

From MaRDI portal
Revision as of 00:25, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Complexity of conflict-free colorings of graphs
scientific article

    Statements

    Complexity of conflict-free colorings of graphs (English)
    0 references
    0 references
    0 references
    6 January 2015
    0 references
    conflict-free coloring
    0 references
    NP-completeness
    0 references
    parametrized algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references