On the Orchard crossing number of prisms, ladders and other related graphs
classification
🧮 math.CO
cs.CGcs.DM
keywords
cyclesgraphscrossingnumberorchardsharedealsdisjoint
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.