Yindi Weng

activity

20192023

most citedProper disconnection of graphs

3 citations · 3 across the 1 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2023

Some results on the rainbow vertex-disconnection colorings of graphs

Yindi Weng

Let $G$ be a nontrivial connected and vertex-colored graph. A vertex subset $X$ is called rainbow if any two vertices in $X$ have distinct colors. The graph $G$ is called \emph{rai…

math.CO2020

Further results on the rainbow vertex-disconnection of graphs

Xueliang Li, Yindi Weng

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.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 $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…