On the Orchard crossing number of prisms, ladders and other related graphs

2011/11/23 by Elie Feder, Feder, Elie, David Garber +1
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #cs.CG #cs.DM #graph theory and CDMA systems #math.CO #msc:05C62 #msc:68R10

paper · pdf · doi:10.48550/arxiv.1111.5412

17 pages, 14 figures; submitted

arxiv created 2011/11/23 · arxiv updated 2011/11/24

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.

Related

• The Orchard crossing number of an abstract graph
• On the Orchard crossing number of complete bipartite graphs
• On the Crossing Numbers of Cartesian Products of Small Graphs with Paths, Cycles and Stars
• A survey of graphs with known or bounded crossing numbers
• Unexpected behaviour of crossing sequences