Drawing disconnected graphs on the Klein bottle
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.
math.CO↗
arXiv subjects
Publications and source records attributed to Antoine Gerbaud.
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.