On the Orchard crossing number of prisms, ladders and other related graphs
Combinatorics
2011-11-24 v1 Computational Geometry
Discrete Mathematics
Abstract
This paper deals with the Orchard crossing number of some families of graphs which are based on cycles. These include disjoint cycles, cycles which share a vertex and cycles which share an edge. Specifically, we focus on the prism and ladder graphs.
Cite
@article{arxiv.1111.5412,
title = {On the Orchard crossing number of prisms, ladders and other related graphs},
author = {Elie Feder and David Garber},
journal= {arXiv preprint arXiv:1111.5412},
year = {2011}
}
Comments
17 pages, 14 figures; submitted