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 2018Show all

2 papers · 1 filter

math.CO2018

The rainbow vertex-disconnection in graphs

Xuqing Bai, You Chen, Ping Li +2

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.CO2018

Monochromatic $k$ -edge-connection colorings of graphs

Ping Li, Xueliang Li

A path in an edge-colored graph $G$ is called monochromatic if any two edges on the path have the same color. For $k \geq 2$ , an edge-colored graph $G$ is said to be monochromatic $…

The rainbow vertex-disconnection in graphs

Monochromatic k-edge-connection colorings of graphs

Monochromatic $k$ -edge-connection colorings of graphs