561 citations · 843 across the 63 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.CO2015
Hardness result for the total rainbow -connection of graphs
Wenjing Li, Xueliang Li, Di Wu
A path in a total-colored graph is called \emph{total rainbow} if its edges and internal vertices have distinct colors. For an -connected graph and an integer with $1…
math.CO2015★ 3 cited
Some extremal results on the colorful monochromatic vertex-connectivity of a graph
Qingqiong Cai, Xueliang Li, Di Wu
A path in a vertex-colored graph is called a \emph{vertex-monochromatic path} if its internal vertices have the same color. A vertex-coloring of a graph is a \emph{monochromatic ve…
math.AP2015
Gevrey class smoothing effect for the Prandtl equation
Weixi Li, Di Wu, Chao-Jiang Xu
It is well known that the Prandtl boundary layer equation is instable, and the well-posedness in Sobolev space for the Cauchy problem is an open problem. Recently, under the Oleini…