Weak near-unanimity functions and digraph homomorphism problems
From MaRDI portal
Publication:1945940
DOI10.1016/j.tcs.2012.12.025zbMath1261.05067MaRDI 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
05C15: Coloring of graphs and hypergraphs
05C20: Directed graphs (digraphs), tournaments
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
Quantified Constraints in Twenty Seventeen, Complexity and polymorphisms for digraph constraint problems under some basic constructions, Menger systems of idempotent cyclic and weak near-unanimity multiplace functions, The \(C_{k}\)-extended graft construction, Analogues of cliques for \((m,n)\)-colored mixed graphs, Dichotomy for finite tournaments of mixed-type