On the Orchard Crossing Number of the Complete Bipartite Graphs $K_{n,n}$

  • Elie Feder
  • David Garber
DOI: https://doi.org/10.37236/688

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}$.

Published
2011-10-10
How to Cite
Feder, E., & Garber, D. (2011). On the Orchard Crossing Number of the Complete Bipartite Graphs $K_{n,n}$. The Electronic Journal of Combinatorics, 18(1), P201. https://doi.org/10.37236/688
Issue
Volume 18, Issue 1 (2011)
Article Number
P201