8 citations · 14 across the 4 of their papers we have counts for
8 papers
Graph colorings under global structural conditions
Xuqing Bai, Xueliang Li
More than ten years ago in 2008, a new kind of graph coloring appeared in graph theory, which is the {\it rainbow connection coloring} of graphs, and then followed by some other ne…
Strong rainbow disconnection in graphs
Xuqing Bai, Xueliang Li
Let be a nontrivial edge-colored connected graph. An edge-cut of is called a {\it rainbow edge-cut} if no two edges of are colored with the same color. For two dist…
Bounds for the rainbow disconnection number of graphs
Xuqing Bai, Zhong Huang, Xueliang Li
An edge-cut of an edge-colored connected graph is called a rainbow-cut if no two edges in the edge-cut are colored the same. An edge-colored graph is rainbow disconnected if fo…
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…
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…
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…