Approximate coloring of uniform hypergraphs
From MaRDI portal
Publication:4820902
DOI10.1016/S0196-6774(03)00077-4zbMath1064.68071MaRDI QIDQ4820902
Michael Krivelevich, Benjamin Sudakov
Publication date: 1 October 2004
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0196-6774(03)00077-4
05C65: Hypergraphs
68R10: Graph theory (including graph drawing) in computer science
05C15: Coloring of graphs and hypergraphs
Related Items
Extended box clustering for classification problems, Longest common subsequence problem for unoriented and cyclic strings, Approximating Independent Set and Coloring in Random Uniform Hypergraphs