8 citations · 24 across the 9 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018★ 3 cited
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…
math.CO2018
More on rainbow disconnection in graphs
Xuqing Bai, Renying Chang, Xueliang Li
Let be a nontrivial edge-colored connected graph. An edge-cut of is called a rainbow cut if no two edges of it are colored the same. An edge-colored graph is rainbo…
math.CO2018
More on limited packings in graphs
Xuqing Bai, Hong Chang, Xueliang Li
A set of vertices in a graph is called a \emph{-limited packing} if for each vertex of , its closed neighbourhood has at most vertices in . The \emph{-l…