7 citations · 17 across the 10 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017
Graphs with conflict-free connection number two
Hong Chang, Trung Duy Doan, Zhong Huang +3
An edge-colored graph is \emph{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 \emph{c…
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
More on the -color connection number of a graph
Hong Chang, Zhong Huang, Xueliang Li
An edge-colored graph is -color connected if, between each pair of vertices, there exists a path using at least different colors. The -color connection number of ,…