1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.CO2016★ 1 cited
Nordhaus-Gaddum-type theorem for total proper connection number of graphs
Wenjing Li, Xueliang Li, Jingshu Zhang
A graph is said to be \emph{total-colored} if all the edges and the vertices of the graph are colored. A path in a total-colored graph is called a \emph{total-proper path}…
math.CO2016
3-Rainbow index and forbidden subgraphs
Wenjing Li, Xueliang Li, Jingshu Zhang
A tree in an edge-colored connected graph is called \emph{a rainbow tree} if no two edges of it are assigned the same color. For a vertex subset , a tree is ca…