Drawing disconnected graphs on the Klein bottle

Simple item page
dc.creatorBeaudou, Laurent
dc.creatorGerbaud, Antoine
dc.creatorGrappe, Roland
dc.creatorPalesi, Frederic
dc.date2008-10-02
dc.date2008-11-04
dc.date.accessioned2026-07-07T10:15:08Z
dc.date.available2026-07-07T10:15:08Z
dc.descriptionWe 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.
dc.description13 pages, second version, major changes in the proof
dc.identifierhttps://arxiv.org/abs/0810.0508
dc.identifierhttp://arxiv.org/abs/0810.0508
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/173085
dc.subjectCombinatorics
dc.subject05C10
dc.titleDrawing disconnected graphs on the Klein bottle
dc.typetext

Files

Collections

arXiv