1 citations · 1 across the 2 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
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
Monochromatic disconnection: Erdős-Gallai-type problems and product graphs
Ping Li, Xueliang Li
For an edge-colored graph , we call an edge-cut of monochromatic if the edges of are colored with a same color. The graph is called monochromatically disconnecte…
math.CO2019
Monochromatic disconnection of graphs
Ping Li, Xueliang Li
For an edge-colored graph , we call an edge-cut of monochromatic if the edges of are colored with a same color. The graph is called monochromatically disconnecte…