|
Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2005, Volume 2, Pages 190–191
(Mi semr39)
|
|
|
|
This article is cited in 3 scientific papers (total 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.
Received October 15, 2005, published October 17, 2005
Citation:
E. A. Fominykh, M. A. Ovchinnikov, “On the complexity of graph-manifolds”, Sib. Èlektron. Mat. Izv., 2 (2005), 190–191
Linking options:
https://www.mathnet.ru/eng/semr39 https://www.mathnet.ru/eng/semr/v2/p190
|
Statistics & downloads: |
Abstract page: | 216 | Full-text PDF : | 49 | References: | 44 |
|