Estimating Matveevʹs complexity via crystallization theory Original Research Article

In [M.R. Casali, Computing Matveevʹs complexity of non-orientable 3-manifolds via crystallization theory, Topology Appl. 144(1–3) (2004) 201–209], a graph-theoretical approach to Matveevʹs complexity computation is introduced, yielding the complete classification of closed non-orientable 3-manifolds up to complexity six. The present paper follows