Meng Ji

activity

20172026

most citedProper disconnection of graphs

3 citations · 5 across the 13 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019★ 3 cited

Proper disconnection of graphs

Xuqing Bai, You Chen, Meng Ji +3

For an edge-colored graph $G$ , a set $F$ of edges of $G$ is called a \emph{proper cut} if $F$ is an edge-cut of $G$ and any pair of adjacent edges in $F$ are assigned by different…

math.CO2019

Strong conflict-free connection of graphs

Meng Ji, Xueliang Li

A path $P$ in an edge-colored graph is called \emph{a conflict-free path} if there exists a color used on only one of the edges of $P$ . An edge-colored graph $G$ is called \emph{co…