Estimating Matveev's complexity via crystallization theory
- 28 March 2007
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 307 (6) , 704-714
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Computing Matveev’s Complexity via Crystallization Theory: The Orientable CaseActa Applicandae Mathematicae, 2006
- Computing Matveev's complexity of non-orientable 3-manifolds via crystallization theoryTopology and its Applications, 2004
- Non-orientable 3-manifolds of small complexityTopology and its Applications, 2003
- Three-Manifolds Having Complexity At Most 9Experimental Mathematics, 2001
- Coloured knots and coloured graphs representing 3-fold simple coverings of %plane1D;54A;3Discrete Mathematics, 1995
- Representing branched coverings by Edge-Coloured GraphsTopology and its Applications, 1989
- THREE-MANIFOLDS AS 3-FOLD BRANCHED COVERS OF S3The Quarterly Journal of Mathematics, 1976
- Every closed orientable 3-manifold is a 3-fold branched covering space of $S^3$Bulletin of the American Mathematical Society, 1974
- A Representation of Orientable Combinatorial 3-ManifoldsAnnals of Mathematics, 1962
- Modifications and Cobounding ManifoldsCanadian Journal of Mathematics, 1960