\(H\)-colorings of dense hypergraphs
From MaRDI portal
Publication:456171
DOI10.1016/j.ipl.2012.08.011zbMath1248.68263MaRDI QIDQ456171
Publication date: 23 October 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.08.011
68Q25: Analysis of algorithms and problem complexity
05C65: Hypergraphs
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
05C42: Density (toughness, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(H\)-coloring dichotomy revisited
- The complexity of colouring problems on dense graphs
- On the complexity of H-coloring
- The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree
- A New Proof of the H-Coloring Dichotomy
- A new line of attack on the dichotomy conjecture