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.
Cite
@article{arxiv.0810.0508,
title = {Drawing disconnected graphs on the Klein bottle},
author = {Laurent Beaudou and Antoine Gerbaud and Roland Grappe and Frederic Palesi},
journal= {arXiv preprint arXiv:0810.0508},
year = {2008}
}
Comments
13 pages, second version, major changes in the proof