M. Siggers

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2024

Reconfiguring homomorphisms to reflexive graphs via a simple reduction

Moritz MÃ¼hlenthaler, Mark H. Siggers, Thomas Suzan

Given a graph $G$ and two graph homomorphisms $I^\pm$ and $I^^{2}$ from $G$ to a fixed graph $H$ , the problem $H$ -Recoloring asks whether there is a transformation from $I^\pm$ to $I^^{2}$ that…

cs.DM2024

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs

Vadim Lozin, Barnaby Martin, Sukanya Pandey +4

For a fixed set $H$ of graphs, a graph $G$ is $H$ -subgraph-free if $G$ does not contain any $H \in H$ as a (not necessarily induced) subgraph. A recently propo…