Completely Independent Spanning Trees in Some Regular Graphs

Benoit Darties, Nicolas Gastineau, Olivier Togni

Let $k\ge 2$ be an integer and $T_1,\dots ,T_k$ be spanning trees of a graph $G$. If for any pair of vertices $(u,v)$ of $V(G)$, the paths from $u$ to $v$ in each $T_i$, $1\le i\l…