arXiv:0810.0508 Abstract | arXiv Analytics

Published 2008-10-02, updated 2008-11-04Version 2

We prove that two disjoint graphs must always be drawn separately on the Klein bottle, in order to minimize the crossing number of the whole drawing.

Comments: 13 pages, second version, major changes in the proof

Categories: math.CO

Subjects: 05C10

Keywords: klein bottle, drawing disconnected graphs, disjoint graphs

Related articles: Most relevant | Search more

arXiv:math/0407008 [math.CO] (Published 2004-07-01, updated 2006-04-06)

Note on the Irreducible Triangulations of the Klein Bottle

Thom Sulanke

arXiv:2002.00258 [math.CO] (Published 2020-02-01)

Excluded minors for the Klein Bottle I. Low connectivity case

arXiv:1406.1341 [math.CO] (Published 2014-06-05)

Cascades and Obstructions of Low Connectivity for Embedding Graphs into the Klein Bottle

arXiv Analytics