COMPUTING MATVEEV'S COMPLEXITY VIA CRYSTALLIZATION THEORY: THE BOUNDARY CASE

DOI10.1142/S0218216513500387zbMath1284.57013arXiv1210.4490MaRDI QIDQ2848021

Maria Rita Casali, Paola Cristofori

Publication date: 25 September 2013

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.4490

zbMATH Keywords

crystallizationSeifert manifoldMatveev's complexity3-manifolds with boundary

Mathematics Subject Classification ID

Related Items (2)

Compact 3-manifolds via 4-colored graphs ⋮ Minimal crystallizations of 3-manifolds with boundary

Cites Work

• Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams
• Estimating Matveev's complexity via crystallization theory
• Cobordant crystallizations
• A graph-theoretical representation of PL-manifolds -- a survey on crystallizations
• On Heegaard decompositions of torus knot exteriors and related Seifert fibre spaces
• Computing Matveev's complexity of non-orientable 3-manifolds via crystallization theory
• Computing Matveev's complexity via crystallization theory: the orientable case
• Representing 3-manifolds by a universal branching set
• COMPLEXITY, HEEGAARD DIAGRAMS AND GENERALIZED DUNWOODY MANIFOLDS
• Classifying Pl 5-Manifolds by Regular Genus: The Boundary Case

This page was built for publication: COMPUTING MATVEEV'S COMPLEXITY VIA CRYSTALLIZATION THEORY: THE BOUNDARY CASE