S. Bard

most citedComplexity of locally-injective homomorphisms to tournaments

4 citations · 4 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2026

The complexity of frugal digraph homomorphisms

Stefan Bard, Gary MacGillivray, Jacobus Swarts

For an integer $t \geq 1$ , a homomorphism of a digraph G to a digraph $H$ is $t$ -frugal if no more than $t$ in-neighbours of any vertex of $G$ have the same image. There is a dicho…

cs.DM2017★ 4 cited

Complexity of locally-injective homomorphisms to tournaments

Stefan Bard, Thomas Bellitto, Christopher Duffy +2

For oriented graphs $G$ and $H$ , a homomorphism $f : G \to H$ is locally-injective if, for every $v \in V (G)$ , it is injective when restricted to some combination of the in-…