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.
| Original language | English |
|---|---|
| Pages (from-to) | 215-232 |
| Number of pages | 18 |
| Journal | Journal of Combinatorial Mathematics and Combinatorial Computing |
| Volume | 91 |
| State | Published - 1 Nov 2014 |
| Externally published | Yes |