The following pages link to Testing hypergraph colorability (Q1770424):
Displaying 8 items.
- Unavoidable tournaments (Q895998) (← links)
- Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
- Testing graphs for colorability properties (Q2768393) (← links)
- Testing \(k\)-colorability (Q2784512) (← links)
- A proof of Green's conjecture regarding the removal properties of sets of linear equations (Q3550257) (← links)
- Hypergraph coloring and reconfigured RAM testing (Q4420050) (← links)
- Testing Euclidean Spanners (Q4933382) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313043) (← links)