3 citations · 3 across the 1 of their papers we have counts for
3 papers
math.CO2019
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…
math.CO2018
The rainbow vertex-disconnection in graphs
Xuqing Bai, You Chen, Ping Li +2
Let be a nontrivial connected and vertex-colored graph. A subset of the vertex set of is called rainbow if any two vertices in have distinct colors. The graph i…