Approximate coloring of uniform hypergraphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1305101
- Approximate hypergraph coloring
- Coloring uniform hypergraphs with few colors
- Coloring uniform hypergraphs with few edges
- Hardness of Approximate Hypergraph Coloring
- Greedy colorings of uniform hypergraphs
- Approximate hypergraph coloring under low-discrepancy and related promises
- Colourings of uniform hypergraphs with large girth and applications
Cited in
(19)- Approximability of the upper chromatic number of hypergraphs
- The hardness of 3-uniform hypergraph coloring
- Approximating coloring and maximum independent sets in 3-uniform hypergraphs
- scientific article; zbMATH DE number 5825874 (Why is no real title available?)
- Approximations to m‐Colored Complete Infinite Hypergraphs
- Approximating Independent Set and Coloring in Random Uniform Hypergraphs
- scientific article; zbMATH DE number 1301963 (Why is no real title available?)
- scientific article; zbMATH DE number 1305101 (Why is no real title available?)
- Approximate hypergraph coloring
- scientific article; zbMATH DE number 1947044 (Why is no real title available?)
- The complexity of 2-coloring and strong coloring in uniform hypergraphs with high degrees
- Linearly ordered colourings of hypergraphs
- A logarithmic approximation of linearly-ordered colourings
- Linearly ordered colourings of hypergraphs
- Larger nearly orthogonal sets over finite fields
- Extended box clustering for classification problems
- Edge-coloring of 3-uniform hypergraphs
- A fast coloring oracle for average case hypergraphs
- Longest common subsequence problem for unoriented and cyclic strings
This page was built for publication: Approximate coloring of uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820902)
