## Abstract Let __G__ be a graph embedded in the Klein bottle with “representativity” at least four. We give a formula for the orientable genus of __G__, which also implies a polynomially bounded algorithm. The formula is in terms of the number of times certain closed curves on the Klein bottle int
Drawing Disconnected Graphs on the Klein Bottle
✍ Scribed by Laurent Beaudou; Antoine Gerbaud; Roland Grappe; Frédéric Palesi
- Publisher
- Springer Japan
- Year
- 2010
- Tongue
- English
- Weight
- 140 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We give necessary and sufficient conditions for a directed graph embedded on the torus or the Klein bottle to contain pairwise disjoint circuits, each of a given orientation and homotopy, and in a given order. For the Klein bottle, the theorem is new. For the torus, the theorem was proved before by
There are two main purposes of this article. First we show that every 3-connected graph embedded in the torus or the Klein bottle has a spanning planar subgraph which is 2-connected, and in fact has a slightly stronger connectivity property. Second, this subgraph is applied to show that every 3-conn
We show how to construct all the graphs that can be embedded on both the torus and the Klein bottle as their triangulations.