\(H\)-colorings of dense hypergraphs

DOI10.1016/J.IPL.2012.08.011zbMath1248.68263OpenAlexW2047764125MaRDI QIDQ456171

Edyta Szymańska

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

zbMATH Keywords

graph algorithms\(H\)-coloringdense hypergraphhypergraph homomorphism

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Density (toughness, etc.) (05C42)

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

This page was built for publication: \(H\)-colorings of dense hypergraphs