3 citations · 6 across the 5 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015★ 3 cited
Proper connection number and graph products
Yaping Mao, Fengnan Yanling, Zhao Wang +1
A path in an edge-colored graph is called \emph{a proper path} if no two adjacent edges of are colored the same, and is \emph{proper connected} if every two vertice…
math.CO2015
Monochromatic connectivity and graph products
Yaping Mao, Zhao Wang, Fengnan Yanling +1
The concept of monochromatic connectivity was introduced by Caro and Yuster. A path in an edge-colored graph is called a \emph{monochromatic path} if all the edges on the path are…