2 citations · 2 across the 3 of their papers we have counts for
3 papers
math.CO2012
An upper bound for the crossing number of augmented cubes
Guoqing Wang, Haoli Wang, Yuansheng Yang +2
A {\it good drawing} of a graph is a drawing where the edges are non-self-intersecting and each two edges have at most one point in common, which is either a common end vertex…
math.CO2011
The crossing number of locally twisted cubes
Haoli Wang, Xirong Xu, Yuansheng Yang +3
The {\it crossing number} of a graph is the minimum number of pairwise intersections of edges in a drawing of . Motivated by the recent work [Faria, L., Figueiredo, C.M.H. d…
math.CO2011★ 2 cited
The crossing number of folded hypercubes
Haoli Wang, Yuansheng Yang, Yan Zhou +2
The {\it crossing number} of a graph is the minimum number of pairwise intersections of edges in a drawing of . The {\it -dimensional folded hypercube} is a graph…