Mathematics – Combinatorics
Scientific paper
2003-03-25
Mathematics
Combinatorics
17 pages, 10 figures. Totally revised, new material added. Submitted
Scientific paper
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.
Feder Elie
Garber David
No associations
LandOfFree
The Orchard crossing number of an abstract graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Orchard crossing number of an abstract graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Orchard crossing number of an abstract graph will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-332880