The Orchard crossing number of an abstract graph
Combinatorics
2009-04-23 v2
Abstract
We introduce the Orchard crossing number, which is defined in a similar way to the well-known rectilinear crossing number. We compute the Orchard crossing number for some simple families of graphs. We also prove some properties of this crossing number. Moreover, we define a variant of this crossing number which is tightly connected to the rectilinear crossing number, and compute it for some simple families of graphs.
Keywords
Cite
@article{arxiv.math/0303317,
title = {The Orchard crossing number of an abstract graph},
author = {Elie Feder and David Garber},
journal= {arXiv preprint arXiv:math/0303317},
year = {2009}
}
Comments
17 pages, 10 figures. Totally revised, new material added. Submitted