2 citations · 2 across the 1 of their papers we have counts for
2 papers
math.CO2016
More on total monochromatic 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 are colored. A total-coloring of a graph is a {\it total monochromatically-connecting color…
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…