6-Critical Graphs on the Klein Bottle
β Scribed by Kawarabayashi, Ken-ichi; Kral', Daniel; Kynl, Jan; Lidicky, Bernard
- Book ID
- 115490725
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 2009
- Tongue
- English
- Weight
- 415 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0895-4801
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## 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
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