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

Elie Feder; David Garber

doi:10.37236/688

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

Issue

Volume 18, Issue 1 (2011)

Article Number

P201