Proper disconnection of graphs

Xuqing Bai, You Chen, Meng Ji +3

For an edge-colored graph $G$, a set $F$ of edges of $G$ is called a \emph{proper cut} if $F$ is an edge-cut of $G$ and any pair of adjacent edges in $F$ are assigned by different…