Orientations of graphs with at most one directed path between every pair of vertices

Barbora Dohnalová, Jiří Kalvoda, Gaurav Kucheriya +1

Given a graph $G$, we say that an orientation $D$ of $G$ is a KT orientation if, for all $u,v\in V(D)$, there is at most one directed path (in any direction) between $u$ and $v$.…