4 citations · 4 across the 1 of their papers we have counts for
1 paper · 1 filter
Zhenzhen Li, Baoyindureng Wu
A path in a vertex-colored graph is called {\it conflict-free} if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be {\it conflict-free vert…