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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1709.03876 / 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: Q3601520 / 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: Online Conflict-Free Colouring for Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for the conflict-free chromatic art gallery problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free chromatic art gallery coverage / 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: How to draw a planar graph on a grid / 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: 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: Sphere and dot product representations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free coloring of intersection graphs of geometric objects / 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

Latest revision as of 11:46, 17 July 2024

scientific article; zbMATH DE number 6984965
Language Label Description Also known as
English
Conflict-Free Coloring of Intersection Graphs
scientific article; zbMATH DE number 6984965

    Statements

    Conflict-Free Coloring of Intersection Graphs (English)
    0 references
    0 references
    0 references
    26 November 2018
    0 references
    conflict-free coloring
    0 references
    intersection graphs
    0 references
    unit disk graphs
    0 references
    complexity
    0 references
    worst-case bounds
    0 references

    Identifiers

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