On the restricted matching extension of graphs on the torus and the Klein bottle
โ Scribed by Qiuli Li; Heping Zhang
- Book ID
- 113567674
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 527 KB
- Volume
- 312
- Category
- Article
- ISSN
- 0012-365X
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