13 citations · 25 across the 7 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015★ 13 cited
Proper connection number and 2-proper connection number of a graph
Fei Huang, Xueliang Li, Shujing Wang
A path in an edge-colored graph is called a proper path if no two adjacent edges of the path are colored with one same color. An edge-colored graph is called -proper connected i…
math.CO2015★ 4 cited
Proper connection numbers of complementary graphs
Fei Huang, Xueliang Li, Shujing Wang
A path in an edge-colored graph is called a proper path if no two adjacent edges of are colored the same, and is proper connected if every two vertices of are c…