The Orchard crossing number of an abstract graph
| dc.creator | Feder, Elie | |
| dc.creator | Garber, David | |
| dc.date | 2003-03-25 | |
| dc.date | 2009-04-23 | |
| dc.date.accessioned | 2026-07-07T13:07:22Z | |
| dc.date.available | 2026-07-07T13:07:22Z | |
| dc.description | 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. | |
| dc.description | 17 pages, 10 figures. Totally revised, new material added. Submitted | |
| dc.identifier | https://arxiv.org/abs/math/0303317 | |
| dc.identifier | http://arxiv.org/abs/math/0303317 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/228069 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C62 | |
| dc.title | The Orchard crossing number of an abstract graph | |
| dc.type | text |