A New Proof of the H-Coloring Dichotomy

DOI10.1137/080736697zbMath1207.05065OpenAlexW1977197609MaRDI QIDQ3058556

Mark H. Siggers

Publication date: 3 December 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080736697

zbMATH Keywords

dichotomy\(H\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

In praise of homomorphisms ⋮ Unnamed Item ⋮ Unnamed Item ⋮ \(H\)-colorings of dense hypergraphs ⋮ Graph partitions with prescribed patterns ⋮ Finite dualities and map-critical graphs on a fixed surface ⋮ Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs ⋮ A quasi-Mal'cev condition with unexpected application.

This page was built for publication: A New Proof of the H-Coloring Dichotomy