In this note we show that, for any surface 7 and any k, there are at most finitely many triangulations of 7 such that each edge is in a noncontractible cycle of length k and is in no shorter noncontractible cycle. Such a triangulation is k-irreducible. This is equivalent to the statement that for an
Irreducible Triangulations of the Klein Bottle
β Scribed by Serge Lawrencenko; Seiya Negami
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 399 KB
- Volume
- 70
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
β¦ Synopsis
We determine the complete list of the irreducible triangulations of the Klein bottle, up to equivalence, analyzing their structures.
1997 Academic Press
1. Introduction
A triangulation of a closed surface is a simple graph embedded on the surface so that each face is triangular and that any two faces have at most one edge in common. (The latter is needed only for the sphere to exclude K 3 from the spherical triangulations.) It is often regarded as a 2-simplicial complex together with its triangular faces. Two triangulations G and G$ of a closed surface F 2 are said to be equivalent if there is a homeomorphism h: F 2 Γ F 2 with h(G)=G$. In the combinatorial sense, such a homeomorphism can be thought of as an isomorphism between two graphs which induces a bijection between their faces. We shall say that two triangulations are isomorphic to each other when they are isomorphic as graphs neglecting their embeddings.
Let abc and acd be two faces which share an edge ac in a triangulation G. The contraction of ac is to delete the edge ac and to identify the path bad with bcd, shrinking the quadrilateral region bounded by the cycle abcd, as shown in Fig. 1. An edge e of G is said to be contractible if the contraction of e yields another triangulation of the surface where G is embedded.
π SIMILAR VOLUMES
We show how to construct all the graphs that can be embedded on both the torus and the Klein bottle as their triangulations.
## Abstract In this paper, we shall show that an irreducible triangulation of a closed surface __F__^2^ has at most __cg__ vertices, where __g__ stands for a genus of __F__^2^ and __c__ a constant. Β© 1995, John Wiley & Sons, Inc.
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
## Abstract Thomassen conjectured that every longest circuit of a 3βconnected graph has a chord. It is proved in this paper that every longest circuit of a 4βconnected graph embedded in a torus or Klein bottle has a chord. Β© 2003 Wiley Periodicals, Inc. J Graph Theory 43: 1β23, 2003