Drawing disconnected graphs on the Klein bottle - Mathematics > CombinatoricsReportar como inadecuado




Drawing disconnected graphs on the Klein bottle - Mathematics > Combinatorics - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

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.



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

Fuente: https://arxiv.org/







Documentos relacionados