Upper complexity bounds for an infinite family of graph-manifolds

zbMath1299.57008MaRDI QIDQ2454494

Evgeny Fominykh

Publication date: 13 June 2014

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: http://semr.math.nsc.ru/v5/p215-228.pdf

zbMATH Keywords

Matveev's complexitygraph-manifold

Mathematics Subject Classification ID

Related Items (2)

Dehn surgeries on the figure eight knot: an upper bound for complexity ⋮ The complexity of orientable graph manifolds

This page was built for publication: Upper complexity bounds for an infinite family of graph-manifolds