activity
20002019
most citedThe many faces of cyclic branched coverings of 2-bridge knots and links

21 citations · 79 across the 26 of their papers we have counts for

collaborators

29 papers

math.GT2019

The complexity of orientable graph manifolds

Alessia Cattabriga, Michele Mulazzani

We give an upper bound for the Matveev complexity of the whole class of closed connected orientable prime graph manifolds that is sharp for all 14502 graph manifolds of the Recogni…

math.GT2018

Compact n-manifolds via (n+1)-colored graphs: a new approach

Luigi Grasselli, Michele Mulazzani

We introduce a representation via (n+1)-colored graphs of compact n-manifolds with (possibly empty) boundary, which appears to be very convenient for computer aided study and tabul…

math.GT2017★ 1 cited

Minimal 4-colored graphs representing an infinite family of hyperbolic 3-manifolds

P. Cristofori, E. Fominykh, M. Mulazzani +1

The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored graphs representing it. Exact calculations of graph complexity have been already pe…

math.GT2017

On the complexity of non-orientable Seifert fibre spaces

Alessia Cattabriga, Sergei Matveev, Michele Mulazzani +1

In this paper we deal with Seifert fibre spaces, which are compact 3-manifolds admitting a foliation by circles. We give a combinatorial description for these manifolds in all the…

math.GT2016★ 15 cited

4-colored graphs and knot/link complements

P. Cristofori, E. Fominykh, M. Mulazzani +1

A representation for compact 3-manifolds with non-empty non-spherical boundary via 4-colored graphs (i.e., 4-regular graphs endowed with a proper edge-coloration with four colors)…

math.GT2013★ 9 cited

Compact 3-manifolds via 4-colored graphs

Paola Cristofori, Michele Mulazzani

We introduce a representation of compact 3-manifolds without spherical boundary components via (regular) 4-colored graphs, which turns out to be very convenient for computer aided…