6 citations · 20 across the 26 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
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.CO2012★ 2 cited
Disproof of a conjecture by Erdős and Guy on the crossing number of hypercubes
Yuansheng Yang, Guoqing Wang, Haoli Wang +1
Let be the -dimensional hypercube, and let be the \textit{crossing number} of . Erdős and Guy in 1973 conjectured the following equality: ${\rm cr}(Q_…