Brett Werner

collaborators

2 papers

math.CO2018

Classification of Reconfiguration Graphs of Shortest Path Graphs With No Induced $4$ -cycles

John Asplund, Brett Werner

For any graph $G$ with $a, b \in V (G)$ , a shortest path reconfiguration graph can be formed with respect to $a$ and $b$ ; we denote such a graph as $S (G, a, b)$ . The vertex set of $S(G,…

math.CO2017

Reconfiguration graphs of shortest paths

John Asplund, Kossi Edoh, Ruth Haas +3

For a graph $G$ and $a, b \in V (G)$ , the shortest path reconfiguration graph of $G$ with respect to $a$ and $b$ is denoted by $S (G, a, b)$ . The vertex set of $S (G, a, b)$ is the set of a…

Classification of Reconfiguration Graphs of Shortest Path Graphs With No Induced 4-cycles

Reconfiguration graphs of shortest paths

Classification of Reconfiguration Graphs of Shortest Path Graphs With No Induced $4$ -cycles