Conflict-Free Coloring of Graphs (Q4556952): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Zachary R. Abel / rank
Normal rank
 
Property / author
 
Property / author: Victor Alvarez / rank
Normal rank
 
Property / author
 
Property / author: Zachary R. Abel / rank
 
Normal rank
Property / author
 
Property / author: Victor Alvarez / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1701.05999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Colors Suffice: Conflict-Free Coloring of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time data reduction for dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. I: Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. II: Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Conflict-Free Colouring for Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong conflict-free coloring for intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The potential to improve the choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph unique-maximum and conflict-free colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Conflict‐Free Coloring for Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Colorings of Rectangles Ranges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of conflict-free colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Colouring of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free coloring of points and simple regions in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5368703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Coloring Made Stronger / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the domination number of a series-parallel graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free coloring of unit disks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-weight triangulation is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Colourings of Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The four-colour theorem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:13, 17 July 2024

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

    Conflict-Free Coloring of Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 November 2018
    0 references
    conflict-free coloring
    0 references
    planar graphs
    0 references
    complexity
    0 references
    worst-case bounds
    0 references
    0 references
    0 references
    0 references

    Identifiers

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