The crossing number cr(G) of a graph G is the minimum possible number of edge-crossings in a drawing of G, the pair-crossing number pcr(G) is the minimum possible number of crossing pairs of edges in a drawing of G, and the odd-crossing number ocr(G) is the minimum number of pairs of edges that cross an odd number of times. Clearly, ocr(G) ≤ pcr(G) ≤ cr(G). We construct graphs with 0.855 · pcr(...

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.