On the orchard crossing number of the complete bipartite graphs Kn,n

Elie Feder, David Garber

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

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 languageEnglish
Pages (from-to)1-13
Number of pages13
JournalElectronic Journal of Combinatorics
Volume18
Issue number1
DOIs
StatePublished - 2011
Externally publishedYes

Fingerprint

Dive into the research topics of 'On the orchard crossing number of the complete bipartite graphs Kn,n'. Together they form a unique fingerprint.

Cite this