29 citations · 147 across the 23 of their papers we have counts for
Showing 2004 · math.GTShow all
2 papers · 2 filters
math.GT2004
Computing Matveev's complexity via crystallization theory: the orientable case
M. R. Casali, P. Cristofori
By means of a slight modification of the notion of GM-complexity, the present paper performs a graph-theoretical approach to the computation of (Matveev's) complexity for closed or…
math.GT2004
Strongly-cyclic branched coverings of knots via -decompositions
Paola Cristofori, Michele Mulazzani, Andrei Vesnin
Strongly-cyclic branched coverings of knots are studied by using their (g,1)-decompositions. Necessary and sufficient conditions for the existence and uniqueness of such coverings…