The Orchard crossing number of an abstract graph

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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.
17 pages, 10 figures. Totally revised, new material added. Submitted

Keywords

Combinatorics, 05C62

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/228069

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0303317
 http://arxiv.org/abs/math/0303317

Collections

arXiv