15 citations · 37 across the 16 of their papers we have counts for
1 paper · 1 filter
Ran Gu, Xueliang Li
An edge-colored graph G 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 c…