Ping Li

activity

20182020

k

-edge-connection colorings of graphs

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

collaborators

Showing 2020Show all

3 papers · 1 filter

math.CO2020

Extremal graphs and classification of planar graphs by MC-numbers

Yanhong Gao, Ping Li, Xueliang Li

An edge-coloring of a connected graph $G$ is called a {\em monochromatic connection coloring} (MC-coloring for short) if any two vertices of $G$ are connected by a monochromatic pa…

math.CO2020

Upper bounds for the $M D$ -numbers and characterization of extremal graphs

Ping Li, Xueliang Li

For an edge-colored graph $G$ , we call an edge-cut $M$ of $G$ monochromatic if the edges of $M$ are colored with the same color. The graph $G$ is called monochromatic disconnected…

math.CO2020★ 1 cited

Rainbow monochromatic $k$ -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 $k$ paths $P_{1}, \dots, P_{k}$ rainbow monochromatic paths if every $…

Extremal graphs and classification of planar graphs by MC-numbers

Upper bounds for the MD-numbers and characterization of extremal graphs

Rainbow monochromatic k-edge-connection colorings of graphs

Upper bounds for the $M D$ -numbers and characterization of extremal graphs

Rainbow monochromatic $k$ -edge-connection colorings of graphs