The following pages link to Coloring bipartite hypergraphs (Q4645934):
Displaying 16 items.
- Networks beyond pairwise interactions: structure and dynamics (Q823239) (← links)
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- Colorings of \(b\)-simple hypergraphs (Q1689874) (← links)
- Path colorings in bipartite graphs (Q1767676) (← links)
- Testing hypergraph colorability (Q1770424) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
- Role coloring bipartite graphs (Q2081494) (← links)
- Concepts on coloring of cluster hypergraphs with application (Q2196923) (← links)
- An expected polynomial time algorithm for coloring 2-colorable 3-graphs (Q2851504) (← links)
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors (Q2968154) (← links)
- Edge-Coloring Bipartite Graphs (Q4943084) (← links)
- (Q5092401) (← links)
- Hardness of Rainbow Coloring Hypergraphs (Q5136325) (← links)
- (Q5870293) (← links)
- Coloring tournaments with few colors: algorithms and complexity (Q6654122) (← links)
