8 citations · 24 across the 9 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019★ 3 cited
Proper disconnection of graphs
Xuqing Bai, You Chen, Meng Ji +3
For an edge-colored graph , a set of edges of is called a \emph{proper cut} if is an edge-cut of and any pair of adjacent edges in are assigned by different…
math.CO2019★ 3 cited
Erdős-Gallai-type results for the rainbow disconnection number of graphs
Xuqing Bai, Xueliang Li
Let be a nontrivial connected and edge-colored graph. An edge-cut of is called a rainbow cut if no two edges of it are colored with a same color. An edge-colored graph…