6 citations · 23 across the 14 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021★ 5 cited
Recolouring Homomorphisms to triangle-free reflexive graphs
Jae-baek Lee, Jonathan A. Noel, Mark Siggers
For a graph , the -recolouring problem asks, for two given homomorphisms from a given graph to , if one can get between them by a sequence of…
math.CO2021
Towards a dichotomy for the switch list homomorphism problem for signed graphs
Hyobin Kim, Mark Siggers
We make advances towards a structural characterisation of the signed graphs for which the list switch -colouring problem problem is polynomial tim…