D. Cranston

activity

20152026

collaborators

Showing 2026Show all

3 papers · 1 filter

math.CO2026

Reconfiguration of Nowhere-zero Flows

Daniel W. Cranston, Jiaao Li, Bo Su +2

Fix an abelian group $A$ , a graph $G$ , and nowhere-zero $A$ -flows $f^{'}$ and $f^{''}$ on $G$ . Now $f^{'}$ and $f^{''}$ are \emph{ $A$ -flow-adjacent} if there exists a cycle $C$ in $G$ such tha…

math.CO2026

Orientations of $10$ -Edge-Connected Planar Multigraphs and Applications

Daniel W. Cranston, Jiaao Li, Bo Su +2

A graph is called strongly $Z_{2 k + 1}$ -connected if for each boundary function $β : V (G) \mapsto Z_{2 k + 1}$ with $\sum_{v \in V (G)} β (v) \equiv 0 (mod 2 k + 1)$ , there exists an orientatio…

math.CO2026

Disjoint Correspondence Colorings for $K_{5}$ -Minor-free Graphs

Wouter Cames van Batenburg, Daniel W. Cranston, František Kardoš

Thomassen famously proved that every planar graph is 5-choosable. We explore variants of this result, focusing on finding disjoint correspondence colorings, in the more general cla…

Reconfiguration of Nowhere-zero Flows

Orientations of 10-Edge-Connected Planar Multigraphs and Applications

Disjoint Correspondence Colorings for K5​-Minor-free Graphs

Orientations of $10$ -Edge-Connected Planar Multigraphs and Applications

Disjoint Correspondence Colorings for $K_{5}$ -Minor-free Graphs