J. Engbers

activity

20112023

most citedOn comparability of bigrassmannian permutations

5 citations · 9 across the 14 of their papers we have counts for

collaborators

Showing 2011Show all

2 papers · 1 filter

math.CO2011

H-coloring tori

John Engbers, David Galvin

For graphs $G$ and $H$ , an $H$ -coloring of $G$ is a function from the vertices of $G$ to the vertices of $H$ that preserves adjacency. $H$ -colorings encode graph theory notions suc…

math.CO2011★ 1 cited

H-colouring bipartite graphs

John Engbers, David Galvin

For graphs $G$ and $H$ , an {\em $H$ -colouring} of $G$ (or {\em homomorphism} from $G$ to $H$ ) is a function from the vertices of $G$ to the vertices of $H$ that preserves adjacency…