On the Orchard crossing number of complete bipartite graphs

Abstract

We compute the Orchard crossing number, which is defined in a similar way to the rectilinear crossing number, for the complete bipartite graphs K_{n,n}.

23 pages, 4 figures; Submitted

References in corpus (1)

• The Orchard crossing number of an abstract graph

Cited by in corpus (1)

• The Orchard crossing number of an abstract graph