On the Orchard crossing number of complete bipartite graphs
classification
🧮 math.CO
cs.DM
keywords
crossingnumberbipartitecompletegraphsorchardcomputedefined
read the original 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}.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.