4 citations · 4 across the 2 of their papers we have counts for
5 papers · 1 filter
Obstructions for homomorphisms to odd cycles in series-parallel graphs
Eun-Kyung Cho, Ilkyoo Choi, Boram Park +1
For a graph , an -colouring of a graph is a vertex map such that adjacent vertices are mapped to adjacent vertices. A graph is -critical i…
The complexity of matroid homomorphism reconfiguration
Cheolwon Heo, Mark Siggers
We consider a reconfiguration version of the homomorphism problem for binary matroids . This reconfiguration problem, , asks…
Reflexive Digraph Reconfiguration by Orientation Strings
David Emmanuel Pazmiño Pullas, Mark Siggers
The reconfiguration problem for homomorphisms of digraphs to a reflexive digraph cycle, which amounts to deciding if a `reconfiguration graph' is connected, is known to by polynomi…
AK-type stability theorems on cross t-intersecting families
Sang June Lee, Mark Siggers, Norihide Tokushige
Two families, and , of subsets of are cross -intersecting if for every and , and intersect in…
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…