Complexity of conflict-free colorings of graphs (Q484316)

From MaRDI portal
Revision as of 02:32, 9 December 2024 by Import241208021249 (talk | contribs) (Normalize DOI.)
scientific article
Language Label Description Also known as
English
Complexity of conflict-free colorings of graphs
scientific article

    Statements

    title
    Complexity of conflict-free colorings of graphs (English)
    0 references
    author
    Luisa Gargano
    0 references
    Adele A. Rescigno
    0 references
    publication date
    6 January 2015
    0 references
    zbMATH Keywords
    conflict-free coloring
    0 references
    NP-completeness
    0 references
    parametrized algorithm
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C15
    0 references
    05C85
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6383896
    0 references
    OpenAlex ID
    W2033159765
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q484316&oldid=38125570"
    Powered by MediaWiki