Weak near-unanimity functions and digraph homomorphism problems
type: Item
instance of: scholarly article
title: Weak near-unanimity functions and digraph homomorphism problems
zbMATH Open document ID: 1261.05067
author: Gary MacGillivray
author: Jacobus Swarts
published in: Theoretical Computer Science
publication date: 2013-04-17T00:00:00Z
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 6154970
zbMATH Keywords: \(H\)-colouring problem
zbMATH Keywords: weak near-unanimity functions
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.12.025
OpenAlex ID: W1976525036
DOI: 10.1016/J.TCS.2012.12.025
Recommended article: Near-Unanimity Functions and Varieties of Reflexive Graphs
Recommended article: A polynomial-time algorithm for near-unanimity graphs
Recommended article: Weak total resolvability in graphs
Recommended article: On the weak-integrity of graphs
Recommended article: Reflexive digraphs with near unanimity polymorphisms
Recommended article: Near-Unanimity Polymorphisms on Structures with Finite Duality
Recommended article: Q3490042
Recommended article: Posets, near unanimity functions and zigzags
Recommended article: On weak domination in graphs
Recommended article: Q3512623
description: scientific article; zbMATH DE number 6154970