More on rainbow disconnection in graphs

Xuqing Bai, Renying Chang, Xueliang Li

Let $G$ be a nontrivial edge-colored connected graph. An edge-cut $R$ of $G$ is called a rainbow cut if no two edges of it are colored the same. An edge-colored graph $G$ is rainbo…