This article is cited in 3 papers

Short communications

On the complexity of graph-manifolds

E. A. Fominykh, M. A. Ovchinnikov

Chelyabinsk State University

Abstract: We provide a new formula for an upper bound of the complexity of non-Seifert graph-manifolds obtained by gluing together two Seifert manifolds fibered over the disc with two exceptional fibers. This bound turns out to be sharp for many manifolds.

UDC: 515.16

MSC: 57M27

Received October 15, 2005, published October 17, 2005

Language: English

Bibliographic databases:

• 
•