On the Orchard Crossing Number of the Complete Bipartite Graphs $K_{n,n}$
Elie Feder, David Garber · The Electronic Journal of Combinatorics · 2011
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2011
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}$.
Open the resolved locator · 10.37236/688
Metadata licence: OpenAlex metadata (CC0)