We study the problem of reconfiguring one minimum s-t-separator A into
a...
An infinite graph is quasi-transitive if its vertex set has finitely man...
For an integer k ≥ 1 and a graph G, let 𝒦_k(G) be the
graph that has ver...
We consider Kempe changes on the k-colorings of a graph on n vertices. I...
Deciding whether a diagram of a knot can be untangled with a given numbe...
We prove that for any ε>0, for any large enough t, there is a
graph G th...