4 citations · 9 across the 8 of their papers we have counts for
8 papers
Conflict-free (vertex)-connection numbers of graphs with small diameters
Xueliang Li, Xiaoyu Zhu
A path in an(a) edge(vertex)-colored graph is called a conflict-free path if there exists a color used on only one of its edges(vertices). An(A) edge(vertex)-colored graph is calle…
Conflict-free connections: algorithm and complexity
Meng Ji, Xueliang Li, Xiaoyu Zhu
A path in an(a) edge(vertex)-colored graph is called \emph{a conflict-free path} if there exists a color used on only one of its edges(vertices). An(A) edge(vertex)-colored graph i…
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…
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…
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…
Solutions for two conjectures on kaleidoscopic edge-colorings
Xueliang Li, Xiaoyu Zhu
For an -regular graph , we define an edge-coloring with colors from , in such a way that any vertex of is incident to at least one edge of each c…
Distance proper connection of graphs and their complements
Xueliang Li, Colton Magnant, Meiqin Wei +1
Let be an edge-colored connected graph. A path in is called a distance -proper path if no two edges of the same color can appear with less than edges in be…
Distance proper connection of graphs
Xueliang Li, Colton Magnant, Meiqin Wei +1
Let be an edge-colored connected graph. A path in is called a distance -proper path if no two edges of the same color appear with fewer than edges in betwe…