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

Elie Feder; David Garber

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

Elie Feder, David Garber

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

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

Cite this

@article{59b51e2d021345e29d28a4e9baa29ccd,

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

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.",

author = "Elie Feder and David Garber",

year = "2014",

month = nov,

day = "1",

language = "אנגלית",

volume = "91",

pages = "215--232",

journal = "Journal of Combinatorial Mathematics and Combinatorial Computing",

issn = "0835-3026",

publisher = "Charles Babbage Research Centre",

}

TY - JOUR

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

AU - Feder, Elie

AU - Garber, David

PY - 2014/11/1

Y1 - 2014/11/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84914672110&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84914672110

SN - 0835-3026

VL - 91

SP - 215

EP - 232

JO - Journal of Combinatorial Mathematics and Combinatorial Computing

JF - Journal of Combinatorial Mathematics and Combinatorial Computing

ER -

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

Abstract

Other files and links

Fingerprint

Cite this