4 citations · 9 across the 8 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.CO2016
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…
math.CO2016
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…
math.CO2016★ 4 cited
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…