A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Conflict-free connection numbers of line graphs
[article]

2017
*
arXiv
*
pre-print

A path in an edge-colored graph is called conflict-free if it contains at least one color used on exactly one of its edges. An edge-colored graph G is conflict-free connected if for any two distinct vertices of G, there is a conflict-free path connecting them. For a connected graph G, the conflict-free connection number of G, denoted by cfc(G), is defined as the minimum number of colors that are required to make G conflict-free connected. In this paper, we investigate the conflict-free

arXiv:1705.05317v1
fatcat:kilqoblqvve5jlcn7cl6plitli