Conflict free colorings of (strongly) almost disjoint set-systems (Q1945294): Difference between revisions

@@ Property / DOI @@
-.1007/s10474-010-0051-5
@@ Property / DOI: 10.1007/s10474-010-0051-5 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.0181
@@ Property / arXiv ID: 1004.0181 / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic conflict-free coloring for intervals
+Normal rank
@@ Property / cites work @@
+On a property of families of sets
@@ Property / cites work: On a property of families of sets / rank @@
+Normal rank
@@ Property / cites work @@
+On the complete subgraphs of graphs defined by systems of sets
+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 @@
+Splitting Strongly Almost Disjoint Families
@@ Property / cites work: Splitting Strongly Almost Disjoint Families / rank @@
+Normal rank
@@ Property / cites work @@
+Q4953197
@@ Property / cites work: Q4953197 / rank @@
+Normal rank
@@ Property / cites work @@
+Families close to disjoint ones
@@ Property / cites work: Families close to disjoint ones / rank @@
+Normal rank
@@ Property / cites work @@
+Q5768776
@@ Property / cites work: Q5768776 / rank @@
+Normal rank
@@ Property / cites work @@
+Conflict-Free Colourings of Graphs and Hypergraphs
+Normal rank
@@ Property / cites work @@
+Transversals for strongly almost disjoint families
+Normal rank
@@ Property / DOI @@
+.1007/S10474-010-0051-5
@@ Property / DOI: 10.1007/S10474-010-0051-5 / rank @@
+Normal rank