Title of article
On k-planar crossing numbers Original Research Article
Author/Authors
Farhad Shahrokhi ، نويسنده , , Ondrej S?kora، نويسنده , , Peter L. Erd s and Laszlo A. Szekely، نويسنده , , Imrich Vrt’o، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
10
From page
1106
To page
1115
Abstract
The k-planar crossing number of a graph is the minimum number of crossings of its edges over all possible drawings of the graph in k planes. We propose algorithms and methods for k-planar drawings of general graphs together with lower bound techniques. We give exact results for the k-planar crossing number of image for image. We prove tight bounds for complete graphs. We also study the rectilinear k-planar crossing number.
Keywords
Rectilinear k-planar crossing number , Complete graph , Complete bipartite graph , Lower bound , Crossing number , k-planar Crossing number
Journal title
Discrete Applied Mathematics
Serial Year
2007
Journal title
Discrete Applied Mathematics
Record number
886491
Link To Document