activity
20162019
most citedConflict-free vertex-connections of graphs

2 citations · 2 across the 4 of their papers we have counts for

collaborators
Showing 2019Show all

1 paper · 1 filter

math.CO2019

Conflict-free (vertex)-connection numbers of graphs with small diameters

Xueliang Li, Xiaoyu Zhu

A path in an(a) edge(vertex)-colored graph is called a conflict-free path if there exists a color used on only one of its edges(vertices). An(A) edge(vertex)-colored graph is calle…