Xuqing Bai

activity

20182023

most citedGraph colorings under global structural conditions

8 citations · 24 across the 9 of their papers we have counts for

collaborators

9 papers

math.CO2023

Cooperative coloring of some graph families

Xuqing Bai, Bi Li, Chuandong Xu +1

In a family $G_{1}, G_{2}, \dots, G_{m}$ of graphs sharing the same vertex set $V$ , a cooperative coloring involves selecting one independent set $I_{i}$ from $G_{i}$ for each $i\in \{1,2…

math.CO2020★ 8 cited

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…

math.CO2020

Strong rainbow disconnection in graphs

Xuqing Bai, Xueliang Li

Let $G$ be a nontrivial edge-colored connected graph. An edge-cut $R$ of $G$ is called a {\it rainbow edge-cut} if no two edges of $R$ are colored with the same color. For two dist…

math.CO2020★ 7 cited

Bounds for the rainbow disconnection number of graphs

Xuqing Bai, Zhong Huang, Xueliang Li

An edge-cut $R$ 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…

math.CO2019★ 3 cited

Proper disconnection of graphs

Xuqing Bai, You Chen, Meng Ji +3

For an edge-colored graph $G$ , a set $F$ of edges of $G$ is called a \emph{proper cut} if $F$ is an edge-cut of $G$ and any pair of adjacent edges in $F$ 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 $G$ be a nontrivial connected and edge-colored graph. An edge-cut $R$ of $G$ is called a rainbow cut if no two edges of it are colored with a same color. An edge-colored graph…

math.CO2018★ 3 cited

The rainbow vertex-disconnection in graphs

Xuqing Bai, You Chen, Ping Li +2

Let $G$ be a nontrivial connected and vertex-colored graph. A subset $X$ of the vertex set of $G$ is called rainbow if any two vertices in $X$ have distinct colors. The graph $G$ i…

math.CO2018

More on rainbow disconnection in graphs

Xuqing Bai, Renying Chang, Xueliang Li

Let $G$ be a nontrivial edge-colored connected graph. An edge-cut $R$ of $G$ is called a rainbow cut if no two edges of it are colored the same. An edge-colored graph $G$ is rainbo…

math.CO2018

More on limited packings in graphs

Xuqing Bai, Hong Chang, Xueliang Li

A set $B$ of vertices in a graph $G$ is called a \emph{ $k$ -limited packing} if for each vertex $v$ of $G$ , its closed neighbourhood has at most $k$ vertices in $B$ . The \emph{ $k$ -l…