3 citations · 5 across the 4 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019★ 1 cited
Complexity results for two kinds of colored disconnections of graphs
You Chen, Ping Li, Xueliang Li +1
The concept of rainbow disconnection number of graphs was introduced by Chartrand et al. in 2018. Inspired by this concept, we put forward the concepts of rainbow vertex-disconnect…
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…