Drawing disconnected graphs on the Klein bottle

2008/10/02 by Laurent Beaudou, Beaudou, Laurent, Antoine Gerbaud +5
Mathematics · #05C10 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C10

paper · pdf · doi:10.48550/arxiv.0810.0508

13 pages, second version, major changes in the proof

arxiv created 2008/11/04 · arxiv updated 2009/12/01

Abstract

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.

Related

• Drawing non-planar graphs with rotation systems on the Klein bottle
• Excluded minors for the Klein Bottle I. Low connectivity case
• Cascades and Obstructions of Low Connectivity for Embedding Graphs into the Klein Bottle
• Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles
• Five-coloring graphs on the Klein bottle