On the Orchard Crossing Number of the Complete Bipartite Graphs $K_{n,n}$
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}$.
2007 ◽
Vol 23
(6)
◽
pp. 659-666
◽
2015 ◽
Vol 33
(1)
◽
pp. 1-12
◽
1982 ◽
Vol 25
(2)
◽
pp. 187-206
Keyword(s):
1975 ◽
Vol 18
(2)
◽
pp. 164-169
◽
2021 ◽
Vol 10
(4)
◽
pp. 2115-2129
2007 ◽
Vol 23
(3)
◽
pp. 255-262
◽