An upper bound for the crossing number of augmented cubes

Guoqing Wang, Haoli Wang, Yuansheng Yang +2

A {\it good drawing} of a graph $G$ 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…