4 citations · 4 across the 2 of their papers we have counts for
3 papers
math.CO2017★ 4 cited
Graph Homomorphism Reconfiguration and Frozen -Colourings
Richard C. Brewster, Jae-Baek Lee, Benjamin Moore +2
For a fixed graph , the reconfiguration problem for -colourings (i.e. homomorphisms to ) asks: given a graph and two -colourings and of , does there exis…
math-ph2017
Graph Minors and the Linear Reducibility of Feynman Diagrams
Benjamin Moore, Karen Yeats
We look at a graph property called reducibility which is closely related to a condition developed by Brown to evaluate Feynman integrals. We show for graphs with a fixed number of…
math.CO2017
On the structure of graphs excluding , , and one other graph as a rooted minor
Benjamin Moore
In this paper we give structural characterizations of graphs not containing rooted , , , and a graph we call .