Q5092401 (Q5092401): Difference between revisions

@@ Property / cites work @@
+Q3129926
@@ Property / cites work: Q3129926 / rank @@
+Normal rank
@@ Property / cites work @@
+New approximation guarantee for chromatic number
@@ Property / cites work: New approximation guarantee for chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Q5002681
@@ Property / cites work: Q5002681 / rank @@
+Normal rank
@@ Property / cites work @@
+New approximation algorithms for graph coloring
@@ Property / cites work: New approximation algorithms for graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs
+Normal rank
@@ Property / cites work @@
+New hardness results for graph and hypergraph colorings
+Normal rank
@@ Property / cites work @@
+Q5278031
@@ Property / cites work: Q5278031 / rank @@
+Normal rank
@@ Property / cites work @@
+On a Fractional Version of Haemers’ Bound
@@ Property / cites work: On a Fractional Version of Haemers’ Bound / rank @@
+Normal rank
@@ Property / cites work @@
+Algebraic approach to promise constraint satisfaction
+Normal rank
@@ Property / cites work @@
+On the quantum chromatic number of a graph
@@ Property / cites work: On the quantum chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring bipartite hypergraphs
@@ Property / cites work: Coloring bipartite hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Index Coding via Semidefinite Programming
@@ Property / cites work: Linear Index Coding via Semidefinite Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Conditional Hardness for Approximate Coloring
@@ Property / cites work: Conditional Hardness for Approximate Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+The hardness of 3-uniform hypergraph coloring
@@ Property / cites work: The hardness of 3-uniform hypergraph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimum vertex cover
+Normal rank
@@ Property / cites work @@
+Extremal problems concerning Kneser-graphs
@@ Property / cites work: Extremal problems concerning Kneser-graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Forbidden Intersections
@@ Property / cites work: Forbidden Intersections / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Near-Optimal Graph Coloring
@@ Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+The Minrank of Random Graphs
@@ Property / cites work: The Minrank of Random Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness of Approximate Hypergraph Coloring
@@ Property / cites work: Hardness of Approximate Hypergraph Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+On the Hardness of 4-Coloring a 3-Colorable Graph
@@ Property / cites work: On the Hardness of 4-Coloring a 3-Colorable Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3931312
@@ Property / cites work: Q3931312 / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring -colorable graphs using relatively small palettes
+Normal rank
@@ Property / cites work @@
+Topological bounds on the dimension of orthogonal representations of graphs
+Normal rank
@@ Property / cites work @@
+Approximate graph coloring by semidefinite programming
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring 3-Colorable Graphs with Less than             <i>n</i>             <sup>1/5</sup>             Colors
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating the chromatic number
+Normal rank
@@ Property / cites work @@
+Q5536167
@@ Property / cites work: Q5536167 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs
+Normal rank
@@ Property / cites work @@
+Q4083461
@@ Property / cites work: Q4083461 / rank @@
+Normal rank
@@ Property / cites work @@
+Kneser's conjecture, chromatic number, and homotopy
+Normal rank
@@ Property / cites work @@
+On the Shannon capacity of a graph
@@ Property / cites work: On the Shannon capacity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Orthogonal representations and connectivity of graphs
+Normal rank
@@ Property / cites work @@
+Two-query PCP with subconstant error
@@ Property / cites work: Two-query PCP with subconstant error / rank @@
+Normal rank
@@ Property / cites work @@
+Orthogonal representations over finite fields and the chromatic number of graphs
+Normal rank
@@ Property / cites work @@
+Kochen–Specker Sets and the Rank-1 Quantum Chromatic Number
+Normal rank
@@ Property / cites work @@
+Q3869375
@@ Property / cites work: Q3869375 / rank @@
+Normal rank
@@ Property / cites work @@
+n-tuple colorings and associated graphs
@@ Property / cites work: n-tuple colorings and associated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The multichromatic numbers of some Kneser graphs
@@ Property / cites work: The multichromatic numbers of some Kneser graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improving the performance guarantee for approximate graph coloring
+Normal rank