Weak near-unanimity functions and digraph homomorphism problems

DOI10.1016/j.tcs.2012.12.025zbMath1261.05067OpenAlexW1976525036MaRDI QIDQ1945940

Gary MacGillivray, Jacobus Swarts

Publication date: 17 April 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.025

zbMATH Keywords

\(H\)-colouring problemweak near-unanimity functions

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (6)

Complexity and polymorphisms for digraph constraint problems under some basic constructions ⋮ Analogues of cliques for \((m,n)\)-colored mixed graphs ⋮ Quantified Constraints in Twenty Seventeen ⋮ The \(C_{k}\)-extended graft construction ⋮ Dichotomy for finite tournaments of mixed-type ⋮ Menger systems of idempotent cyclic and weak near-unanimity multiplace functions

This page was built for publication: Weak near-unanimity functions and digraph homomorphism problems