5 citations · 11 across the 7 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.CO2015★ 5 cited
Total proper connection of graphs
Hui Jiang, Xueliang Li, Yingying Zhang
A graph is said to be {\it total-colored} if all the edges and the vertices of the graph is colored. A path in a total-colored graph is a {\it total proper path} if any two a…
math.CO2015★ 2 cited
On (strong) proper vertex-connection of graphs
Hui Jiang, Xueliang Li, Yingying Zhang +1
A path in a vertex-colored graph is a {\it vertex-proper path} if any two internal adjacent vertices differ in color. A vertex-colored graph is {\it proper vertex -connected} if…
math.CO2015
Good upper bounds for the total rainbow connection of graphs
Hui Jiang, Xueliang Li, Yingying Zhang
A total-colored graph is a graph such that both all edges and all vertices of are colored. A path in a total-colored graph is a total rainbow path if its edges and inte…