Drawing disconnected graphs on the Klein bottle

arxiv: 0810.0508 · v2 · submitted 2008-10-02 · 🧮 math.CO

Laurent Beaudou , Antoine Gerbaud , Roland Grappe , Frederic Palesi This is my paper

classification 🧮 math.CO

keywords bottledrawinggraphskleinalwayscrossingdisconnecteddisjoint

0 comments

read the original 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.

This paper has not been read by Pith yet.