4 citations · 9 across the 8 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017★ 2 cited
Conflict-free vertex-connections of graphs
Xueliang Li, Yingying Zhang, Xiaoyu Zhu +2
A path in a vertex-colored graph is called \emph{conflict free} if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be \emph{conflict-free ve…
math.CO2017
Total proper connection and graph operations
Yingying Zhang, Xiaoyu Zhu
A graph is said to be {\it total-colored} if all the edges and vertices of the graph are colored. A path in a total-colored graph is a {\it total proper path} if any two adja…
math.CO2017★ 1 cited
Proper vertex connection and graph operations
Yingying Zhang, Xiaoyu Zhu
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…