12 citations · 27 across the 10 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
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…
math.CO2017
Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs
Wenjing Li, Xueliang Li, Colton Magnant +1
A graph is said to be \emph{total-colored} if all the edges and the vertices of the graph are colored. A total-colored graph is \emph{total-rainbow connected} if any two vertices o…