1 citations · 1 across the 2 of their papers we have counts for
6 papers
Upper bounds for the -numbers and characterization of extremal graphs
Ping Li, Xueliang Li
For an edge-colored graph , we call an edge-cut of monochromatic if the edges of are colored with the same color. The graph is called monochromatic disconnected…
Rainbow monochromatic -edge-connection colorings of graphs
Ping Li, Xueliang Li
A path in an edge-colored graph is called a monochromatic path if all edges of the path have a same color. We call paths rainbow monochromatic paths if every $…
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…
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…
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…
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…