The following pages link to (Q4252044):
Displaying 10 items.
- Testing hypergraph colorability (Q1770424) (← links)
- The existence of uniform hypergraphs for which the interpolation property of complete coloring fails (Q2065902) (← links)
- Semi-definite positive programming relaxations for graph \(K_n\)-coloring in frequency assignment. (Q2773169) (← links)
- Approximations to <i>m</i>‐Colored Complete Infinite Hypergraphs (Q3466346) (← links)
- Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma (Q4521547) (← links)
- An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes (Q4626305) (← links)
- Approximate coloring of uniform hypergraphs (Q4820902) (← links)
- Improved bounds and algorithms for hypergraph 2-coloring (Q4943351) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- (Q5091252) (← links)