Changing a given configuration in a graph into another one is known as a reconfiguration problem. Such problems have recently received much interest in the context of algorithmic graph theory. Weâ€¦ (More)

This paper studies the fundamental problem of how to reroute k unsplittable flows of a certain demand in a capacitated network from their current paths to their respective new paths, in aâ€¦ (More)

14 Changing a given configuration in a graph into another one is known as a reconfiguration problem. 15 Such problems have recently received much interest in the context of algorithmic graph theory.â€¦ (More)

We introduce the concept of matching connectivity as a notion of connectivity in graphs admitting perfect matchings. The notion relies heavily on structural properties of those matchings. We prove aâ€¦ (More)

In this work we investigate the chordality of squares and line graph squares of graphs. We prove a sufficient condition for the chordality of squares of graphs not containing induced cycles of lengthâ€¦ (More)