36 citations · 45 across the 8 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017★ 4 cited
Nordhaus-Gaddum-type theorem for conflict-free connection number of graphs
Hong Chang, Zhong Huang, Xueliang Li +2
An edge-colored graph is \emph{conflict-free connected} if, between each pair of distinct vertices, there exists a path containing a color used on exactly one of its edges. The…
math.CO2017★ 2 cited
Conflict-free vertex-connections of graphs
Xueliang Li, Yingying Zhang, Xiaoyu Zhu +2
A path in a vertex-colored graph is called \emph{conflict free} if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be \emph{conflict-free ve…
math.CO2017★ 1 cited
Conflict-free connection numbers of line graphs
Bo Deng, Wenjing Li, Xueliang Li +2
A path in an edge-colored graph is called \emph{conflict-free} if it contains at least one color used on exactly one of its edges. An edge-colored graph is \emph{conflict-free…