Separating path systems for cubic graphs and for complete bipartite graphs

Cristina Fernandes, Carlos Hoppen, George Kontogeorgiou +2

A strongly separating path system in a graph $G$ is a collection $\mathcal{P}$ of paths in $G$ such that, for every two edges $e$ and $f$ of $G$, there is a paths in $\mathcal{P}$…