5 citations · 17 across the 10 of their papers we have counts for
10 papers
Planar Turán number of disjoint union of and
Ping Li
The {\em planar Turán number} of , denoted by , is the maximum number of edges in an -free planar graph. The planar Turán number of vertex-di…
Extremal graphs and classification of planar graphs by MC-numbers
Yanhong Gao, Ping Li, Xueliang Li
An edge-coloring of a connected graph is called a {\em monochromatic connection coloring} (MC-coloring for short) if any two vertices of are connected by a monochromatic pa…
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…