Conflict-Free Coloring of Graphs (Q4556952)

From MaRDI portal
Revision as of 12:13, 17 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6986036
Language Label Description Also known as
English
Conflict-Free Coloring of Graphs
scientific article; zbMATH DE number 6986036

    Statements

    title
    Conflict-Free Coloring of Graphs (English)
    0 references
    author
    Erik D. Demaine
    0 references
    Sándor P. Fekete
    0 references
    Aman Gour
    0 references
    Adam Hesterberg
    0 references
    Phillip Keldenich
    0 references
    Christian Scheffer
    0 references
    Zachary R. Abel
    0 references
    Victor Alvarez
    0 references
    publication date
    28 November 2018
    0 references
    zbMATH Keywords
    conflict-free coloring
    0 references
    planar graphs
    0 references
    complexity
    0 references
    worst-case bounds
    0 references
    cites work
    Q3601520
    0 references
    Q5837979
    0 references
    Q5368703
    0 references

    Identifiers

    DOI
    10.1137/17M1146579
    0 references
    Mathematics Subject Classification ID
    05C10
    0 references
    05C15
    0 references
    05C69
    0 references
    05C83
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6986036
    0 references
    arXiv ID
    1701.05999
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4556952&oldid=36452351"
    Powered by MediaWiki