Drawing disconnected graphs on the Klein bottle - Mathematics > CombinatoricsReport as inadecuate




Drawing disconnected graphs on the Klein bottle - Mathematics > Combinatorics - Download this document for free, or read online. Document in PDF available to download.

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



Author: Laurent Beaudou, Antoine Gerbaud, Roland Grappe, Frederic Palesi

Source: https://arxiv.org/







Related documents