Q6084349 (Q6084349): Difference between revisions

@@ Property / DOI @@
-.4230/lipics.approx/random.2020.6
@@ Property / DOI: 10.4230/lipics.approx/random.2020.6 / rank @@
-Normal rank
@@ Property / cites work @@
+Coloring graphs with sparse neighborhoods
@@ Property / cites work: Coloring graphs with sparse neighborhoods / rank @@
+Normal rank
@@ Property / cites work @@
+Q2798999
@@ Property / cites work: Q2798999 / rank @@
+Normal rank
@@ Property / cites work @@
+Sublinear Algorithms for (Δ + 1) Vertex Coloring
@@ Property / cites work: Sublinear Algorithms for (Δ + 1) Vertex Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+On the Lovász Theta function for Independent Sets in Sparse Graphs
+Normal rank
@@ Property / cites work @@
+The Johansson‐Molloy theorem for DP‐coloring
@@ Property / cites work: The Johansson‐Molloy theorem for DP‐coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Set Partitioning via Inclusion-Exclusion
@@ Property / cites work: Set Partitioning via Inclusion-Exclusion / rank @@
+Normal rank
@@ Property / cites work @@
+Chromatic number, girth and maximal degree
@@ Property / cites work: Chromatic number, girth and maximal degree / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation
+Normal rank
@@ Property / cites work @@
+An optimal distributed (Δ+1)-coloring algorithm?
@@ Property / cites work: An optimal distributed (Δ+1)-coloring algorithm? / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring triangle‐free graphs with local list sizes
+Normal rank
@@ Property / cites work @@
+(2Δ — l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting
+Normal rank
@@ Property / cites work @@
+Q3922703
@@ Property / cites work: Q3922703 / rank @@
+Normal rank
@@ Property / cites work @@
+Introduction to Property Testing
@@ Property / cites work: Introduction to Property Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed (∆+1)-coloring in sublogarithmic rounds
+Normal rank
@@ Property / cites work @@
+A Note on Vertex List Colouring
@@ Property / cites work: A Note on Vertex List Colouring / rank @@
+Normal rank
@@ Property / cites work @@
+On Brooks' Theorem for Sparse Graphs
@@ Property / cites work: On Brooks' Theorem for Sparse Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The list chromatic number of graphs with small clique number
+Normal rank
@@ Property / cites work @@
+A bound on the strong chromatic index of a graph
@@ Property / cites work: A bound on the strong chromatic index of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph colouring and the probabilistic method
@@ Property / cites work: Graph colouring and the probabilistic method / rank @@
+Normal rank
@@ Property / cites work @@
+(Delta+1) Coloring in the Congested Clique Model
@@ Property / cites work: (Delta+1) Coloring in the Congested Clique Model / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds
+Normal rank
@@ Property / cites work @@
+Distributed coloring algorithms for triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Q4242948
@@ Property / cites work: Q4242948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4248539
@@ Property / cites work: Q4248539 / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotically the list colouring constants are 1
@@ Property / cites work: Asymptotically the list colouring constants are 1 / rank @@
+Normal rank
@@ Property / cites work @@
+On a packing and covering problem
@@ Property / cites work: On a packing and covering problem / rank @@
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.APPROX/RANDOM.2020.6
@@ Property / DOI: 10.4230/LIPICS.APPROX/RANDOM.2020.6 / rank @@
+Normal rank