collaborators

1 paper

math.CO2020

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…