Abstract
We compute the Orchard crossing number, which is defined in a similar way to the rectilinear crossing number, for the complete bipartite graphs Kn,n.
Original language | English |
---|---|
Pages (from-to) | 1-13 |
Number of pages | 13 |
Journal | Electronic Journal of Combinatorics |
Volume | 18 |
Issue number | 1 |
DOIs | |
State | Published - 2011 |
Externally published | Yes |