Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

On the Orchard Crossing Number of Prisms, Ladders and Other Related Graphs

Elie Feder1, David Garber2
1Kingsborough Community College of CUNY, Department of Mathematics and Computer Science, 2001 Oriental Blvd., Brooklyn, NY 11235, USA
2Department of Applied Mathematics, Faculty of Sciences, Holon Institute of Technology, 52 Golomb St., PO Box 305, Holon 58102, Israel and (Sabbatical:) Einstein Institute of Mathematics, Hebrew University of Jerusalem, Jerusalem, Israel
  • Published: 30/11/2014

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.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Elie Feder, David Garber. On the Orchard Crossing Number of Prisms, Ladders and Other Related Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 091. 215-232. DOI: .