Recommendations
Cites work
- .878-approximation algorithms for MAX CUT and MAX 2SAT
- A Random Recolouring Method for Graphs and Hypergraphs
- A Spectral Technique for Coloring Random 3-Colorable Graphs
- An algorithmic approach to the Lovász local lemma. I
- Approximate graph coloring by semidefinite programming
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 3480514 (Why is no real title available?)
- scientific article; zbMATH DE number 3528420 (Why is no real title available?)
- Improving the performance guarantee for approximate graph coloring
- The complexity of colouring problems on dense graphs
Cited in
(22)- Colorings of b-simple hypergraphs
- Path colorings in bipartite graphs
- Testing hypergraph colorability
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs
- Role coloring bipartite graphs
- Concepts on coloring of cluster hypergraphs with application
- Bipartite bihypergraphs: a survey and new results
- Conditions for the bicolorability of primitive hypergraphs
- An expected polynomial time algorithm for coloring 2-colorable 3-graphs
- Hardness of coloring 2-colorable 12-uniform hypergraphs with \(2^{(\log n)^{\Omega(1)}}\) colors
- scientific article; zbMATH DE number 1002208 (Why is no real title available?)
- Edge-Coloring Bipartite Graphs
- Approximating the orthogonality dimension of graphs and hypergraphs
- Hardness of rainbow coloring hypergraphs
- Streaming algorithms for 2-coloring uniform hypergraphs
- A polynomial time algorithm for checking 2-chromaticity for recursively constructed k-terminal hypergraphs
- Approximating the orthogonality dimension of graphs and hypergraphs
- Coloring tournaments with few colors: algorithms and complexity
- Improved linearly ordered colorings of hypergraphs via SDP rounding
- A fast coloring oracle for average case hypergraphs
- Networks beyond pairwise interactions: structure and dynamics
- Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability
This page was built for publication: Coloring bipartite hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645934)
