3 citations · 5 across the 13 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018
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…
math.CO2018★ 2 cited
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…