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

@@ Property / arXiv ID @@
+.05999
@@ Property / arXiv ID: 1701.05999 / rank @@
+Normal rank
@@ Property / cites work @@
+Three Colors Suffice: Conflict-Free Coloring of Planar Graphs
+Normal rank
@@ Property / cites work @@
+Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
+Normal rank
@@ Property / cites work @@
+Polynomial-time data reduction for dominating set
@@ Property / cites work: Polynomial-time data reduction for dominating set / rank @@
+Normal rank
@@ Property / cites work @@
+Q3601520
@@ Property / cites work: Q3601520 / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. II: Reducibility
+Normal rank
@@ Property / cites work @@
+Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Online Conflict-Free Colouring for Hypergraphs
@@ Property / cites work: Online Conflict-Free Colouring for Hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Strong conflict-free coloring for intervals
@@ Property / cites work: Strong conflict-free coloring for intervals / rank @@
+Normal rank
@@ Property / cites work @@
+The potential to improve the choice
@@ Property / cites work: The potential to improve the choice / rank @@
+Normal rank
@@ Property / cites work @@
+Graph unique-maximum and conflict-free colorings
@@ Property / cites work: Graph unique-maximum and conflict-free colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Online Conflict‐Free Coloring for Intervals
@@ Property / cites work: Online Conflict‐Free Coloring for Intervals / rank @@
+Normal rank
@@ Property / cites work @@
+Conflict-Free Colorings of Rectangles Ranges
@@ Property / cites work: Conflict-Free Colorings of Rectangles Ranges / rank @@
+Normal rank
@@ Property / cites work @@
+Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
+Normal rank
@@ Property / cites work @@
+Complexity of conflict-free colorings of graphs
@@ Property / cites work: Complexity of conflict-free colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Conflict-Free Colouring of Graphs
@@ Property / cites work: Conflict-Free Colouring of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5837979
@@ Property / cites work: Q5837979 / rank @@
+Normal rank
@@ Property / cites work @@
+Conflict-free coloring of points and simple regions in the plane
+Normal rank
@@ Property / cites work @@
+Q5368703
@@ Property / cites work: Q5368703 / rank @@
+Normal rank
@@ Property / cites work @@
+Conflict-Free Coloring Made Stronger
@@ Property / cites work: Conflict-Free Coloring Made Stronger / rank @@
+Normal rank
@@ Property / cites work @@
+A linear algorithm for the domination number of a series-parallel graph
+Normal rank
@@ Property / cites work @@
+Conflict-free coloring of unit disks
@@ Property / cites work: Conflict-free coloring of unit disks / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum-weight triangulation is NP-hard
@@ Property / cites work: Minimum-weight triangulation is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Conflict-Free Colourings of Graphs and Hypergraphs
+Normal rank
@@ Property / cites work @@
+The four-colour theorem
@@ Property / cites work: The four-colour theorem / rank @@
+Normal rank