3 citations · 3 across the 4 of their papers we have counts for
5 papers
Conflict-free connection number and independence number of a graph
Jing Wang, Meng Ji
An edge-colored graph is conflict-free connected if any two of its vertices are connected by a path, which contains a color used on exactly one of its edges. The conflict-free…
Proper disconnection of graphs
Xuqing Bai, You Chen, Meng Ji +3
For an edge-colored graph , a set of edges of is called a \emph{proper cut} if is an edge-cut of and any pair of adjacent edges in are assigned by different…
Strong conflict-free connection of graphs
Meng Ji, Xueliang Li
A path 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 . An edge-colored graph is called \emph{co…
Erdös-Gallai-type results for conflict-free connection of graphs
Meng Ji, Xueliang Li
A path in an edge-colored graph is called \emph{a conflict-free path} if there exists a color used on only one of its edges. An edge-colored graph is called \emph{conflict-free con…
Conflict-free connections: algorithm and complexity
Meng Ji, Xueliang Li, Xiaoyu Zhu
A path in an(a) edge(vertex)-colored graph is called \emph{a conflict-free path} if there exists a color used on only one of its edges(vertices). An(A) edge(vertex)-colored graph i…