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

Elie Feder; David Garber

doi:10.37236/688

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

Elie Feder, David Garber

Research output: Contribution to journal › Article › peer-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 K_n,n.

Original language	English
Pages (from-to)	1-13
Number of pages	13
Journal	Electronic Journal of Combinatorics
Volume	18
Issue number	1
DOIs	https://doi.org/10.37236/688
State	Published - 2011
Externally published	Yes

Access to Document

10.37236/688

Cite this

@article{722af6194e2e4294858ea7a3cf5e10bd,

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

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.",

author = "Elie Feder and David Garber",

year = "2011",

doi = "10.37236/688",

language = "אנגלית",

volume = "18",

pages = "1--13",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Electronic Journal of Combinatorics",

number = "1",

}

TY - JOUR

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

AU - Feder, Elie

AU - Garber, David

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=80054678520&partnerID=8YFLogxK

U2 - 10.37236/688

DO - 10.37236/688

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:80054678520

SN - 1077-8926

VL - 18

SP - 1

EP - 13

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 1

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this