The following pages link to (Q3129926):
Displaying 9 items.
- Testing hypergraph colorability (Q1770424) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← 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)
- (Q4828988) (← links)
- (Q5092401) (← links)
- On 2-Subcolourings of Chordal Graphs (Q5458558) (← links)
- (Q5870293) (← links)
- Coloring tournaments with few colors: algorithms and complexity (Q6654122) (← links)