Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

GD

2005

Springer

2005

Springer

The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the number of pairs of edges that intersect an odd number of times, we obtain the odd crossing number. We show that there is a graph for which these two concepts diﬀer, answering a well-known open question on crossing numbers. To derive the result we study drawings of maps on the annulus. 1 A Confusion of Crossing Numbers Intuitively, the crossing number of a graph is the smallest number of edge crossings in any plane drawing of the graph. As it turns out, this deﬁnition leaves room for interpretation, depending on how we answer the questions: what is a drawing, what is a crossing, and how do we count crossings? The papers by Pach and T´oth [4] and Sz´ekely [5] discuss the historical development of various interpretations and, often implicit, deﬁnitions of the crossing number concept. A drawing D of a graph...

Related Content

Added |
27 Jun 2010 |

Updated |
27 Jun 2010 |

Type |
Conference |

Year |
2005 |

Where |
GD |

Authors |
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |

Comments (0)